Volume queries in polyhedra

DOI10.1007/3-540-47738-1_13MaRDI QIDQ4547801zbMATH OpenFDO

Authors John Iacono, Stefan Langerman

Publication date 21 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2098/20980156

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Storing the subdivision of a polyhedral surface
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• On the complexity of halfspace area queries
• On the complexity of halfspace area queries
• Repetitive hidden-surface-removal for polyhedral scenes

Cited in

(5)

• Dynamic ham-sandwich cuts in the plane
• On the complexity of halfspace area queries
• Storing the subdivision of a polyhedral surface
• scientific article; zbMATH DE number 2073634 (Why is no real title available?)
• On the complexity of halfspace area queries

This page was built for publication: Volume queries in polyhedra

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