Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 13 Nov 2020 in cs.CG and cs.CE

Abstract: 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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.