Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon

DOI10.1080/01630561003757801zbMath1196.52001OpenAlexW2004570919WikidataQ57659447 ScholiaQ57659447MaRDI QIDQ3578011

D. T. Giang, N. N. N. Hai, Phan Thanh An

Publication date: 13 July 2010

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630561003757801

zbMATH Keywords

Helly's theoremRadon's theoremgeodesic convex hullgeodesic convex setEuclidean geodesic path

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Axiomatic and generalized convexity (52A01) Convex sets in (2) dimensions (including convex curves) (52A10) Helly-type theorems and geometric transversal theory (52A35)

Related Items

Blaschke-type theorem and separation of disjoint closed geodesic convex sets ⋮ A parallel algorithm based on convexity for the computing of Delaunay tessellation ⋮ Piercing pairwise intersecting geodesic disks ⋮ Attraction-convexity and normal visibility

Cites Work

• Unnamed Item
• Computing the geodesic center of a simple polygon
• The furthest-site geodesic Voronoi diagram
• Computing geodesic furthest neighbors in simple polygons
• An efficient algorithm for determining the convex hull of a finite planar set
• Euclidean shortest paths in the presence of rectilinear barriers
• Method of orienting curves for determining the convex hull of a finite set of points in the plane
• Zur Lösung eines zermelosehen nayigationsproblems
• Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
• Method of orienting curves for solving optimal control problems with state constraints¹
• Computational Geometry in C
• Some Geometrical Properties of Outer γ-Convex Sets
• δ-Convexity in Normed Linear Spaces
• COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
• Helly-Type Theorems for Roughly Convex-Like Sets
• Finding the convex hull of a simple polygon