Structure and computation of straight skeletons in 3-space

F. Aurenhammer, G. Walzl

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

Abstract

We characterize the self-parallel (mitered) offsets of a general nonconvex polytope Q in 3-space and give a canonical algorithm that constructs a straight skeleton for Q.
Original languageEnglish
Title of host publicationProc. 24th International Symposium on Algorithms and Computation (ISAAC'13)
Place of PublicationHong Kong
PublisherSpringer
Pages44-54
Volume8283
DOIs
Publication statusPublished - 2013
EventInternational Symposium on Algorithms and Computation - Hong Kong, China
Duration: 16 Dec 201318 Dec 2013

Publication series

NameLecture Notes in Computer Science

Conference

ConferenceInternational Symposium on Algorithms and Computation
Country/TerritoryChina
CityHong Kong
Period16/12/1318/12/13

Fields of Expertise

  • Information, Communication & Computing

Fingerprint

Dive into the research topics of 'Structure and computation of straight skeletons in 3-space'. Together they form a unique fingerprint.

Cite this