Polygon offsetting using a Voronoi diagram and two stacks

Document Type

Article

Publication Date

1-1-1998

Abstract

The generation of the trimmed offset of a simple polygon is a conceptually simple but important and computationally non-trivial geometric problem for many applications. This article presents a linear time algorithm to compute a trimmed offset of a simple polygon consisting of arcs as well as line segments in a plane. Assuming that a Voronoi diagram of the polygon is available, the algorithm uses two stacks: T-stack and C-stack. The T-stack contains intersections between an offset and Voronoi edges, and the C-stack contains an offset chain which is a part of the trimmed offset. The contents of both stacks are pushed into and popped from the stacks in a synchronized fashion depending on the events that occur during the offsetting process. © 1999 Elsevier Science Ltd. All rights reserved.

Identifier

0032285473 (Scopus)

Publication Title

CAD Computer Aided Design

External Full Text Location

https://doi.org/10.1016/S0010-4485(98)00063-3

ISSN

00104485

First Page

1069

Last Page

1076

Issue

14

Volume

30

This document is currently not available here.

Share

COinS