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 | Computer-Aided Design |
| Volume | 25 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 1993 |
| Externally published | Yes |
Keywords
- algorithms
- geometric modelling
- polygons
ASJC Scopus subject areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Industrial and Manufacturing Engineering
Fingerprint Dive into the research topics of 'Robust polygon modelling'. Together they form a unique fingerprint.
Cite this
Milenkovic, V. (1993). Robust polygon modelling. Computer-Aided Design, 25(9), 546-566. https://doi.org/10.1016/0010-4485(93)90071-U