SIGN IN
SIGN UP
Polygonal path approximation with angle constraints
Full Text:
PDF
Buy this Article
Authors:
Danny Z. Chen
Dept. of Comp. Sci. and Eng., Univ. of Notre Dame, Notre Dame, IN
Ovidiu Daescu
Dept. of Comp. Sci., Univ. of Texas at Dallas, Richardson, TX
John Hershberger
Mentor Graphics, 8005 S.W. Boeckman Road, Wilsonville, OR
Peter M. Kogge
Dept. of Comp. Sci. and Eng., Univ. of Notre Dame, Notre Dame, IN
Jack Snoeyink
Dept. of Comp. Sci., Univ. of North Carolina at Chapel Hill, Chapel Hill, NC
2001 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 283
· Citation Count: 3
Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pages 342-343
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2001
table of contents
ISBN:0-89871-490-7
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
general
geometric algorithms, languages, and systems
geometrical problems and computations
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder