Upper envelope onion peeling

DOI10.1016/0925-7721(92)90027-PzbMath0773.68070OpenAlexW2060503117MaRDI QIDQ1199830

J. E. Hershberger

Publication date: 17 January 1993

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(92)90027-p

zbMATH Keywords

\(P\)-completeconvex layers of a point setenvelope layers problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Multilist layering: Complexity and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Dynamic fractional cascading
• Visibility of disjoint polygons
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• On the convex layers of a planar set
• Applications of a semi-dynamic convex hull algorithm

This page was built for publication: Upper envelope onion peeling