Polygonal extrusion |
| |
Authors: | Sang C Park |
| |
Affiliation: | (1) Cubic Technology Research Center, AceTechno-Tower 1101, 684-1, DungChon-dong, KangSeo-Ku, Seoul, Korea E-mail: mar123@orgio.net, KR |
| |
Abstract: | A sweeping operation called polygonal extrusion is defined to improve the modeling power of CSG-based modeling. It is assumed that a 2D cross-sectional polygon (sweeping
polygon) moves in space while its containing plane is kept orthogonal to the tangent direction of the trajectory curve, a planar
polygonal chain having no self-intersections. The objective of the paper is to compute the boundary of the swept volume of
the sweeping polygon as a set of polygons (or triangles). The most significant challenge to accomplishing this objective is
the problem of trimming the swept volume. To solve the trimming problem, 2D-curve offsetting methods are employed. Two algorithms
are presented for polygonal extrusion that are based on different offsetting methods, the Voronoi diagram and PWID offset.
The proposed algorithms have been implemented and tested with various examples.
Published online: 28 January 2003 |
| |
Keywords: | : Swept volume – Polygonal extrusion – Trimming – Voronoi – PWID offset |
本文献已被 SpringerLink 等数据库收录! |
|