Title: Stable maintenance of point set triangulations in two dimensions
Abstract:Geometric algorithms are explored, assuming that arithmetic is done approximately. Stable algorithms are described for two geometric problems. The first algorithm computes two-dimensional convex hulls...Geometric algorithms are explored, assuming that arithmetic is done approximately. Stable algorithms are described for two geometric problems. The first algorithm computes two-dimensional convex hulls. The main result is that a triangulation of a set of points in the plane can be maintained stably. The second algorithm deals with line arrangements in the plane.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>Read More
Publication Year: 1989
Publication Date: 1989-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 85
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot