The Partition Technique for Overlays of Envelopes

DOI10.1137/S009753970240700XzbMath1052.68132OpenAlexW2132063258MaRDI QIDQ4706235

Vladlen Koltun, Micha Sharir

Publication date: 19 June 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753970240700x

zbMATH Keywords

computational geometryenvelopearrangementoverlaypartition technique

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (8)

On neighbors in geometric permutations. ⋮ On the union of cylinders in three dimensions ⋮ Lines avoiding balls in three dimensions revisited ⋮ On the number of views of translates of a cube and related problems. ⋮ Line transversals to disjoint balls ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ On Kinetic Delaunay Triangulations ⋮ On overlays and minimization diagrams

This page was built for publication: The Partition Technique for Overlays of Envelopes