Geographic routing in a datagram internetwork
Geographic routing in a datagram internetwork
On the complexity of halfspace area queries
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Dynamic ham-sandwich cuts in the plane
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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 use in other application domains.