scientific article; zbMATH DE number 7236408
From MaRDI portal
Publication:5115770
DOI10.4230/LIPIcs.SoCG.2018.4zbMath1489.68336arXiv1803.05765MaRDI QIDQ5115770
Frank Staals, Lars Arge, Pankaj K. Agarwal
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1803.05765
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (5)
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ Dynamic data structures for \(k\)-nearest neighbor queries ⋮ Exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle ⋮ Unnamed Item ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relative \((p,\varepsilon )\)-approximations in geometry
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- A new data structure for shortest path queries in a simple polygon
- Reporting points in halfspaces
- The furthest-site geodesic Voronoi diagram
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- Applications of random sampling in computational geometry. II
- Optimal shortest path queries in a simple polygon
- Dynamic half-space range reporting and its applications
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- Optimal Point Location in a Monotone Subdivision
- Decomposable searching problems I. Static-to-dynamic transformation
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Maintenance of geometric extrema
- Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
- Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes
This page was built for publication:
