Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons

Autor:	Minati De, Michael T. Goodrich, Gill Barequet
Rok vydání:	2021
Předmět:	TheoryofComputation_MISCELLANEOUS Straight skeleton General Computer Science Computer science Efficient algorithm Applied Mathematics MathematicsofComputing_GENERAL Regular polygon 0102 computer and information sciences 02 engineering and technology Computer Science::Computational Geometry 01 natural sciences Computer Science Applications Combinatorics Line segment 010201 computation theory & mathematics Combinatorial complexity TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Theory of computation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Voronoi diagram ComputingMethodologies_COMPUTERGRAPHICS MathematicsofComputing_DISCRETEMATHEMATICS
Zdroj:	Algorithmica. 83:2245-2272
ISSN:	1432-0541 0178-4617
DOI:	10.1007/s00453-021-00824-9
Popis:	In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore the combinatorial complexity of these diagrams, and provide efficient algorithms for computing compact representations of them.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a2e9125a0f131da1a312e2ecf6d0121f https://doi.org/10.1007/s00453-021-00824-9 Zobrazit plný text záznamu Full text from SpringerLink