Some problems in computational geometry

DOI10.1007/BF01840354zbMath0642.68080MaRDI QIDQ1101225

Claire Mathieu

Publication date: 1987

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

Voronoi diagramcomputational geometryminimum spanning treeDelaunay triangulationproblemsgeometrical algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Finding Hamiltonian cycles in Delaunay triangulations is NP-complete ⋮ Toughness and Delaunay triangulations

Cites Work

• Divide and conquer for linear expected time
• The Ultimate Planar Convex Hull Algorithm?
• Optimal Expected-Time Algorithms for Closest Point Problems
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some problems in computational geometry