1.6.15 Maintaining Line Arrangements
INPUT OUTPUT
Input Description:
A set of lines and line segments
l_1,...,\l_n
.
Problem:
What is the decomposition of the plane defined by
l_1,...,\l_n
?
Implementations
Arrange - maintainance of arrangements with point location (C) (rating 9)
LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 7)
Related Problems
Robust Geometric Primitives
Intersection Detection
Point Location
Go to the corresponding chapter in the book
About the Book
Send us Mail
Go to Main Page
This page last modified on Tue Jun 03, 1997
.