Simple traversal of a subdivision without extra storage

Authors:
Mark de Berg;René van Oostrum;Mark Overmars
Affiliations:
Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, The Netherlands;Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, The Netherlands;Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, The Netherlands
Venue:
Proceedings of the twelfth annual symposium on Computational geometry
Year:
1996

Citing 3
Cited 3

Optimal point location in a monotone subdivision

SIAM Journal on Computing
Combinatorial face enumeration in convex polytopes

Computational Geometry: Theory and Applications
Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain

SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques

Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Triangulations in CGAL (extended abstract)

Proceedings of the sixteenth annual symposium on Computational geometry
Triangulations in CGAL

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract