Thumbnail
Access Restriction
Subscribed

Author Mulmuley, Kentan
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1991
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Computational complexity ♦ Computational geometry ♦ Hidden surface removal ♦ Planar subdivision ♦ Randomized geometric algorithms
Abstract Randomized, optimal algorithms to find a partition of the plane induced by a set of algebraic segments of a bounded degree, and a set of linear chains of a bounded degree, are given. This paper also provides a new technique for clipping, called virtual clipping, whose overhead per window $\textit{W}$ depends logarithmically on the number if intersections between the borders of $\textit{W}$ and the input segments. In contrast, the overhead of the conventional clipping technique depends linearly on this number of intersections. As an application of virtual clipping, a new simple and efficient algorithm for plannar point location is given.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1991-01-03
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 38
Issue Number 1
Page Count 30
Starting Page 74
Ending Page 103


Open content in new tab

   Open content in new tab
Source: ACM Digital Library