A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Oscar Palacios-Velez Colegio de Postgraduados, Chapingo, Mexico
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 16 Issue 3, Sept. 1990
Pages 275-291
ACM New York, NY, USA
table of contents doi>10.1145/79505.79512
A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems Published by ACM 1990 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 18
· Downloads (cumulative): 501
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder