Abstract
The paper provides a set of algorithms for performing set operations on polygonal regions in the plane using standard floating-point arithmetic. The algorithms are robust, guaranteeing both topological consistency and numerical accuracy. Each polygon edge is modelled as an implicit or explicit polygonal curve which stays within some distance ß of the original line segment. If the curve is implicit, ß is bounded by a small multiple of the rounding unit. If the curves are explicit, the bound on ß may grow with the number of curves. One can mix implicit and explicit representations to suit the application.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 546-566 |
| Number of pages | 21 |
| Journal | CAD Computer Aided Design |
| Volume | 25 |
| Issue number | 9 |
| DOIs | |
| State | Published - 1993 |
| Externally published | Yes |
Fingerprint
Keywords
- algorithms
- geometric modelling
- polygons
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Industrial and Manufacturing Engineering
- Geometry and Topology
Cite this
Robust polygon modelling. / Milenkovic, Victor.
In: CAD Computer Aided Design, Vol. 25, No. 9, 1993, p. 546-566.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Robust polygon modelling
AU - Milenkovic, Victor
PY - 1993
Y1 - 1993
N2 - The paper provides a set of algorithms for performing set operations on polygonal regions in the plane using standard floating-point arithmetic. The algorithms are robust, guaranteeing both topological consistency and numerical accuracy. Each polygon edge is modelled as an implicit or explicit polygonal curve which stays within some distance ß of the original line segment. If the curve is implicit, ß is bounded by a small multiple of the rounding unit. If the curves are explicit, the bound on ß may grow with the number of curves. One can mix implicit and explicit representations to suit the application.
AB - The paper provides a set of algorithms for performing set operations on polygonal regions in the plane using standard floating-point arithmetic. The algorithms are robust, guaranteeing both topological consistency and numerical accuracy. Each polygon edge is modelled as an implicit or explicit polygonal curve which stays within some distance ß of the original line segment. If the curve is implicit, ß is bounded by a small multiple of the rounding unit. If the curves are explicit, the bound on ß may grow with the number of curves. One can mix implicit and explicit representations to suit the application.
KW - algorithms
KW - geometric modelling
KW - polygons
UR - http://www.scopus.com/inward/record.url?scp=0027663954&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027663954&partnerID=8YFLogxK
U2 - 10.1016/0010-4485(93)90071-U
DO - 10.1016/0010-4485(93)90071-U
M3 - Article
AN - SCOPUS:0027663954
VL - 25
SP - 546
EP - 566
JO - CAD Computer Aided Design
JF - CAD Computer Aided Design
SN - 0010-4485
IS - 9
ER -