Mitered offsets and straight skeletons for circular arc polygons

B. Weiß, B. Jüttler, F. Aurenhammer

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review


We generalize the offsetting process that defines straight skeletons of polygons to circular arc polygons. The offsets and the associated skeleton are obtained by applying an evolution process to the boundary and tracing the paths of vertices. These paths define the associated patch decomposition. While the skeleton is a forest, the patches of the decomposition possess a radial monotonicity property. Analyzing the events that occur during the evolution process is non-trivial. This leads us to an event-driven algorithm for offset and skeleton computation. Several examples (both manually created ones and approximations of planar free-form shapes by arc polygons) are presented and used to analyze the performance of our algorithm.
Original languageEnglish
Title of host publicationProc. 34th European Workshop on Computational Geometry (EuroCG'18)
Place of PublicationBerlin, Germany
Publication statusPublished - 2018
Event34th European Workshop on Computational Geometry - FU Berlin, Berlin, Germany
Duration: 21 Mar 201823 Mar 2018


Conference34th European Workshop on Computational Geometry
Abbreviated titleEuroCG 2018
Internet address


Dive into the research topics of 'Mitered offsets and straight skeletons for circular arc polygons'. Together they form a unique fingerprint.

Cite this