Voronoi-based splinegon decomposition and shortest-path tree computation
type: Item
instance of: scholarly article
title: Voronoi-based splinegon decomposition and shortest-path tree computation
author: Xiyu Bao
author: Meng Qi
author: Chenglei Yang
author: Wei Gai
published in: Computer Aided Geometric Design
publication date: 2024-06-28T00:00:00Z
Mathematics Subject Classification ID: 65Dxx
zbMATH DE Number: 7873098
zbMATH Keywords: splinegon
zbMATH Keywords: decomposition
zbMATH Keywords: shortest path tree
zbMATH Keywords: Voronoi diagram
MaRDI profile type: Publication
cites work: COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
cites work: Algorithms for fair partitioning of convex polygons
cites work: On de Casteljau's algorithm
cites work: Shortest path planning for a tethered robot
cites work: Computing Shortest Paths among Curved Obstacles in the Plane
cites work: Computing a rectilinear shortest path amid splinegons in plane
cites work: Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
cites work: Q3003643
cites work: Computational geometry in a curved world
cites work: Decomposition and intersection of simple splinegons
cites work: Q5088963
cites work: Degenerate point/curve and curve/curve bisectors arising in medial axis computations for planar domains with curved boundaries
cites work: Algorithms for the decomposition of a polygon into convex polygons
cites work: Visibility Algorithms in the Plane
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: On the computational geometry of pocket machining
cites work: Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
cites work: Fair partitions of polygons: an elementary introduction
cites work: Minimizing Distance-to-Sight in Polygonal Domains
cites work: Q5358292
DOI: 10.1016/J.CAGD.2024.102316
description: scientific article; zbMATH DE number 7873098