Mitered offsets and straight skeletons for circular arc polygons

Bastian Weiß, Bert Jüttler, Franz Aurenhammer

Research output: Contribution to conferencePaperResearch

Abstract

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
Publication statusPublished - 2018
Event34th European Workshop on Computational Geometry - FU Berlin, Berlin, Germany
Duration: 21 Mar 201823 Mar 2018
https://conference.imp.fu-berlin.de/eurocg18/home

Conference

Conference34th European Workshop on Computational Geometry
Abbreviated titleEuroCG 2018
CountryGermany
CityBerlin
Period21/03/1823/03/18
Internet address

Fingerprint

Decomposition

Cite this

Weiß, B., Jüttler, B., & Aurenhammer, F. (2018). Mitered offsets and straight skeletons for circular arc polygons. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.

Mitered offsets and straight skeletons for circular arc polygons. / Weiß, Bastian; Jüttler, Bert; Aurenhammer, Franz.

2018. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.

Research output: Contribution to conferencePaperResearch

Weiß, B, Jüttler, B & Aurenhammer, F 2018, 'Mitered offsets and straight skeletons for circular arc polygons' Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany, 21/03/18 - 23/03/18, .
Weiß B, Jüttler B, Aurenhammer F. Mitered offsets and straight skeletons for circular arc polygons. 2018. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.
Weiß, Bastian ; Jüttler, Bert ; Aurenhammer, Franz. / Mitered offsets and straight skeletons for circular arc polygons. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.
@conference{18fef53224764e9cb0daf2ad5f2d574d,
title = "Mitered offsets and straight skeletons for circular arc polygons",
abstract = "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.",
author = "Bastian Wei{\ss} and Bert J{\"u}ttler and Franz Aurenhammer",
year = "2018",
language = "English",
note = "34th European Workshop on Computational Geometry, EuroCG 2018 ; Conference date: 21-03-2018 Through 23-03-2018",
url = "https://conference.imp.fu-berlin.de/eurocg18/home",

}

TY - CONF

T1 - Mitered offsets and straight skeletons for circular arc polygons

AU - Weiß, Bastian

AU - Jüttler, Bert

AU - Aurenhammer, Franz

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

M3 - Paper

ER -