The \(\gamma\)-neighborhood graph

DOI10.1016/0925-7721(92)90003-BzbMath0748.68089MaRDI QIDQ1194312

Remco C. Veltkamp

Publication date: 27 September 1992

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

neighborhood graphDelaunay triangulationHamilton cycle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Optimal and suboptimal robust algorithms for proximity graphs ⋮ Beta-skeletons have unbounded dilation ⋮ Computing a subgraph of the minimum weight triangulation ⋮ Sigma-local graphs ⋮ Fast algorithms for computing \(\beta\)-skeletons and their relatives. ⋮ Surface reconstruction using umbrella filters ⋮ Empty region graphs ⋮ Surface reconstruction by offset surface filtering

Cites Work

• Unnamed Item
• Unnamed Item
• The expected size of some graphs in computational geometry
• A non-Hamiltonian, nondegenerate Delaunay triangulation
• Voronoi diagrams from convex hulls
• The relative neighbourhood graph of a finite planar set
• On the homogeneous planar Poisson point process
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• On the shape of a set of points in the plane
• Two algorithms for constructing a Delaunay triangulation
• Convex hulls of finite sets of points in two and three dimensions

This page was built for publication: The \(\gamma\)-neighborhood graph