Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

JCDCG
2000
Springer

favoriteEmaildiscussreport

122views Discrete Geometry» more JCDCG 2000»

Volume Queries in Polyhedra

13 years 8 months ago

Volume Queries in Polyhedra

Download eref.uqu.edu.sa

We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume and the area of the portion of the polyhedron above S. The queries are answered in a time linear in the size (complexity) of S. The space and preprocessing time for this data structure are linear in the size of P. We also present an intermediary data structure for planar graphs which is of independent interest.

John Iacono, Stefan Langerman

Real-time Traffic

Data Structure | Discrete Geometry | JCDCG 2000 | Polyhedron | Practical Data Structure |

claim paper

Related Content

» The Volume as a Metric Invariant of Polyhedra

» Straight skeletons of threedimensional polyhedra

» Determining the Separation of Preprocessed Polyhedra A Unified Approach

» Similarity Measure Computation of Convex Polyhedra Revisited

» Faster ASV Decomposition for Orthogonal Polyhedra Using the Extreme Vertices Model EVM

» Sublinear geometric algorithms

» The VSBUFFER visibility ordering of unstructured volume primitives by polygon drawing

» A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Poly...

» Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	JCDCG
Authors	John Iacono, Stefan Langerman

Comments (0)