Cover Image

Exact solutions to the Weighted Region Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	de Berg, Sarita, Esteban, Guillermo, Silveira, Rodrigo I., Staals, Frank
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
by: de Berg, Sarita, et al.
Published: (2023)

The Complexity of Geodesic Spanners
by: de Berg, Sarita, et al.
Published: (2023)

Simpler and Faster Contiguous Art Gallery
by: de Berg, Sarita, et al.
Published: (2025)

The Complexity of Geodesic Spanners using Steiner Points
by: de Berg, Sarita, et al.
Published: (2024)

On strictly output sensitive color frequency reporting
by: Glazenburg, Erwin, et al.
Published: (2026)

Approximating shortest paths in weighted square and hexagonal meshes
by: Bose, Prosenjit, et al.
Published: (2024)

On approximating shortest paths in weighted triangular tessellations
by: Bose, Prosenjit, et al.
Published: (2021)

Convexity Helps Iterated Search in 3D
by: Afshani, Peyman, et al.
Published: (2025)

Terrain prickliness: theoretical grounds for high complexity viewsheds
by: Acharyya, Ankush, et al.
Published: (2021)

Range Counting Oracles for Geometric Problems
by: Driemel, Anne, et al.
Published: (2025)

The Contiguous Art Gallery Problem is in Θ(n log n)
by: de Berg, Sarita, et al.
Published: (2025)

Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
by: van der Laan, Joost, et al.
Published: (2026)

Fine-Grained Complexity of Earth Mover's Distance under Translation
by: Bringmann, Karl, et al.
Published: (2024)

On geodesic disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2025)

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
by: van der Hoog, Ivor, et al.
Published: (2024)

Minimum Exposure Motion Planning
by: de Berg, Sarita, et al.
Published: (2026)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
by: Picarella, Gianmarco, et al.
Published: (2025)

On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)

Competitive Searching over Terrains
by: de Berg, Sarita, et al.
Published: (2024)

Instance-Optimal Imprecise Convex Hull
by: de Berg, Sarita, et al.
Published: (2025)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

On Approximating the Weighted Region Problem in Square Tessellations
by: Kakimura, Naonori, et al.
Published: (2024)

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
by: de Berg, Sarita, et al.
Published: (2025)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
by: Gao, Jie, et al.
Published: (2025)

Robust Classification of Dynamic Bichromatic point Sets in R2
by: Glazenburg, Erwin, et al.
Published: (2024)

Clustering with Few Disks to Minimize the Sum of Radii
by: Abrahamsen, Mikkel, et al.
Published: (2023)

On the complexity of covering points by guillotine cuts
by: Garijo, Delia, et al.
Published: (2026)

Geometric Bipartite Matching Based Exact Algorithms for Server Problems
by: Raghvendra, Sharath, et al.
Published: (2025)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
by: de Berg, Mark, et al.
Published: (2026)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
by: de Berg, Sarita, et al.
Published: (2026)

Maximum-Weight Two Boxes Symmetric Difference Problem
by: Goycoolea, José Fernández, et al.
Published: (2026)

Algorithms for Distance Problems in Continuous Graphs
by: Cabello, Sergio, et al.
Published: (2025)

Computational aspects of disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2026)

Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)

The Borsuk number of a graph
by: Cáceres, José, et al.
Published: (2026)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
by: de Berg, Mark, et al.
Published: (2024)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
by: de Berg, Mark, et al.
Published: (2025)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
by: de Berg, Mark, et al.
Published: (2026)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
by: de Berg, Sarita, et al.
Published: (2026)