An exact, complete and efficient implementation for computing planar maps of quadric intersection curves

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Eric Berberich Max-Planck-Institut für Informatik, Saarbrücken, Germany
Michael Hemmer Johannes-Gutenberg-Universität, Mainz, Germany
Lutz Kettner Max-Planck-Institut für Informatik, Saarbrücken, Germany
Elmar Schömer Johannes-Gutenberg-Universität, Mainz, Germany
Nicola Wolpert Max-Planck-Institut für Informatik, Saarbrücken, Germany
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 17
· Downloads (cumulative): 300
· Citation Count: 26

Published in:
Cover Image
 
· Proceeding
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Pages 99-106
ACM New York, NY, USA ©2005
table of contents ISBN:1-58113-991-8 doi>10.1145/1064092.1064110

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