Some computational aspects of geodesic convex sets in a simple polygon

DOI10.1080/01630561003757801MaRDI QIDQ3578011zbMATH OpenOpenAlexWikidataFDO

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

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) Convex sets in (2) dimensions (including convex curves) (52A10) Axiomatic and generalized convexity (52A01) Helly-type theorems and geometric transversal theory (52A35)

Recommendations

• COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
• On Helly's theorem: Algorithms and extensions
• Some computational aspects of Helly-type theorems
• Convex hulls in polygonal domains
• scientific article; zbMATH DE number 1882491

Cites work

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

Cited in

(11)

• Piercing pairwise intersecting geodesic disks
• Attraction-convexity and normal visibility
• Geodesic order types
• On geodetic sets formed by boundary vertices
• An algorithm for set operations on nonconvex polygons (with an application to census tracts)
• Relatively convex subsets of simply connected planar sets
• Convex hulls in polygonal domains
• Geodesic order types
• Blaschke-type theorem and separation of disjoint closed geodesic convex sets
• Some computational aspects of Helly-type theorems
• A parallel algorithm based on convexity for the computing of Delaunay tessellation

This page was built for publication: Some computational aspects of geodesic convex sets in a simple polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578011)