An Improved Algorithm for Subdivision Traversal without Extra Storage

@article{Bose2002AnIA,
  title={An Improved Algorithm for Subdivision Traversal without Extra Storage},
  author={Prosenjit Bose and Pat Morin},
  journal={Int. J. Comput. Geometry Appl.},
  year={2002},
  volume={12},
  pages={297-308}
}

From This Paper

Figures, tables, and topics from this paper.
22 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Finding the interse tion of two onvex polyhedra

  • D. E. Muller, F. P. Preparata.
  • LEDA A Platform for Combinatorial and Geometri…
  • 1999

Optimal point lo ation in a monotonesubdivision

  • L. J. Guibas H. Edelsbrunner
  • SIAM Journal on Computing
  • 1986

Spatially ordered networks and topographi re onstrutions

  • S. Corma k.
  • 1986

Stol . Primitives for the manipulation of general subdivisionsand the omputation of Voronoi diagrams

  • L. J. Guibas, J.
  • ACM Transa tions on Graphi s
  • 1985

Sin lair . De entralized extremanding in ir ular on gurations of pro esses

  • B. J.
  • Communi ations of the ACM
  • 1980

Triangulation and spatial ordering in omputer artography

  • U. Maydell.
  • Pro eedings of the Canadian Cartographi Asso…
  • 1978

Automated ontour mapping usingtriangular element data and an interpolant over ea h irregular triangular domain

  • T. D. Charters C. M. Gold, J. Ramsden
  • Computer Graphi s
  • 1977

Hirs hberg and

  • S. D.

Similar Papers

Loading similar papers…