Asymptotic speed-ups in constructive solid geometry

DOI10.1007/BF01190849MaRDI QIDQ1894301zbMATH OpenFDO

Authors David Eppstein

Publication date 9 August 1995

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

constructive solid geometry

Mathematics Subject Classification ID

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

Recommendations

• An efficient algorithm for finding the CSG representation of a simple polygon
• Publication:3204071
• Refinement methods for geometric bounds in constructive solid geometry
• Construction and optimization of CSG representations
• Publication:3204077

Cites work

• scientific article; zbMATH DE number 432757 (Why is no real title available?)
• scientific article; zbMATH DE number 432805 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3778747 (Why is no real title available?)
• An efficient algorithm for finding the CSG representation of a simple polygon
• An optimal algorithm for intersecting line segments in the plane
• Topologically sweeping an arrangement

Cited in

(2)

• Speeding up the incremental construction of the union of geometric objects in practice.
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction

This page was built for publication: Asymptotic speed-ups in constructive solid geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894301)