A linear-time construction of the relative neighborhood graph within a histogram
From MaRDI portal
Publication:5057436
DOI10.1007/3-540-60220-8_65zbMath1502.68335OpenAlexW2141587636MaRDI QIDQ5057436
Asish Kumar Mukhopadhyay, Andrzej Lingas
Publication date: 16 December 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60220-8_65
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Generalized Delaunay triangulation for planar graphs
- Constrained Delaunay triangulations
- The relative neighbourhood graph of a finite planar set
- Triangulating a simple polygon
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- Triangulating Simple Polygons and Equivalent Problems
- Two algorithms for constructing a Delaunay triangulation
- MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON
- A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
- Fast skeleton construction
