AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE

DOI10.1142/S0218195903001293zbMath1066.52026MaRDI QIDQ4661880

Iddo Hanniel, Chaim Linhart, Dan Halperin, Sariel Har-Peled

Publication date: 30 March 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

on-line algorithmsconvex hullszonebinary space partitionarrangements of lineshalfplane intersection

Mathematics Subject Classification ID

Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Uses Software

• CGAL
• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Another efficient algorithm for convex hulls in two dimensions
• Maintenance of configurations in the plane
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• On the area bisectors of a polygon
• An efficient algorithm for determining the convex hull of a finite planar set
• Taking a Walk in a Planar Arrangement
• Dynamic planar convex hull operations in near-logarithmic amortized time
• Computing a Face in an Arrangement of Line Segments and Related Problems
• Constructing Planar Cuttings in Theory and Practice
• On the design of CGAL a computational geometry algorithms library

This page was built for publication: AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE