Computational geometry: an introduction
Computational geometry: an introduction
Comparison of three curve intersection algorithms
Computer-Aided Design
Loop detection in surface patch intersections
Computer Aided Geometric Design
Curves and surfaces for computer aided geometric design: a practical guide
Curves and surfaces for computer aided geometric design: a practical guide
The arc tree: an approximation scheme to represent arbitrary curved shapes
Computer Vision, Graphics, and Image Processing
Curve intersection using Be´zier clipping
Computer-Aided Design - Special Issue: Be´zier Techniques
Fundamentals of computer aided geometric design
Fundamentals of computer aided geometric design
Strip trees: a hierarchical representation for curves
Communications of the ACM
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
Hierarchical representation of digitized curves through dominant point detection
Pattern Recognition Letters
Virtual fixture based haptic rendering of handwriting
VECIMS'09 Proceedings of the 2009 IEEE international conference on Virtual Environments, Human-Computer Interfaces and Measurement Systems
| Hi-index | 0.00 |
The performance of three curve representation schemes are compared. They are the strip-tree, Bezier-curve-employing, and arc-tree methods. Each scheme represents a curved shape as a hierarchy of approximations, where higher levels in the hierarchy correspond to coarser approximations of the curve. In addition, each approximation typically corresponds to a bounding area that encloses the actual curve. When geometric operations are computed, coarse approximation of the curve are initially addressed and finer approximation levels are processed if necessary. It is shown that the three representations differ in the choice of bounding areas, the type and amount of information stored at each approximation level, and the method of deciding whether to proceed to finer approximations.