A universal predictor-corrector type incremental algorithm for the construction of weighted straight skeletons based on the notion of deforming polygon

11/13/2020
by   Baris Irhan, et al.
0

A new predictor-corrector type incremental algorithm is proposed for the exact construction of weighted straight skeletons of 2D general planar polygons of arbitrary complexity based on the notion of deforming polygon. In the proposed algorithm, the raw input provided by the polygon itself is enough to resolve edge collapse and edge split events. Neither the construction of a kinetic triangulation nor the computation of a motorcycle graph is required. Due to its incremental nature, there is always a room in the algorithm for the interactive construction of the straight skeleton. The proposed algorithm is of predictor-corrector type. In the algorithm, the edge collapse and edge split events are tackled by a completely different novel original approach which is first of its kind. In the predictor step, the position of the vertices is advanced in time by direct integration assuming no event. Then predicted positions are corrected by using linear interpolation if there are edge collapse or edge split events within the same increment. In the algorithm edge collapse and edge split events are detected by, respectively, edge swap and edge penetration. The proposed algorithm has been used to construct roof topology starting from a floor plan of various complexity ranging from simple convex to highly nonconvex with holes. In order to construct, improve and test the building blocks of the underlying algorithm, a graphical user interface, Straight Skeleton Development Kit, has also been developed in parallel by the author using C++ programming language.

READ FULL TEXT

page 7

page 18

page 21

page 22

page 24

research
03/14/2022

Swap, Shift and Trim to Edge Collapse a Filtration

Boissonnat and Pritam introduced an algorithm to reduce a filtration of ...
research
08/29/2022

Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

In a planar confluent orthogonal drawing (PCOD) of a directed graph (dig...
research
09/13/2019

Linear Size Planar Manhattan Network for Convex Point Sets

Let G = (V, E) be an edge-weighted geometric graph such that every edge ...
research
10/20/2019

Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity

We show that every labelled planar graph G can be assigned a canonical e...
research
02/11/2020

A simple certifying algorithm for 3-edge-connectivity

A linear-time certifying algorithm for 3-edge-connectivity is presented....
research
08/03/2021

Skeleton Split Strategies for Spatial Temporal Graph Convolution Networks

A skeleton representation of the human body has been proven to be effect...

Please sign up or login with your details

Forgot password? Click here to reset