Convex hulls in polygonal domains

DOI10.4230/LIPICS.SWAT.2018.8zbMATH Open1477.68458MaRDI QIDQ5116471FDOQ5116471

Author name not available (Why is that?)

Publication date: 25 August 2020

Recommendations

• The geodesic diameter of polygonal domains
• Some computational aspects of geodesic convex sets in a simple polygon
• The geodesic diameter of polygonal domains
• Relative convex hull determination from convex hulls in the plane
• The convex hull of a set of convex polygons

zbMATH Keywords

shortest pathgeometric graphpolygonal domaingeodesic hull

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Axiomatic and generalized convexity (52A01)

Cites Work

• Detecting Weakly Simple Polygons
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• The complexity of computing minimum separating polygons
• Almost tight upper bounds for lower envelopes in higher dimensions
• Optimal shortest path queries in a simple polygon
• The geodesic diameter of polygonal domains
• Querying two boundary points for shortest paths in a polygonal domain
• Matrix Searching with the Shortest-Path Metric
• Geodesic ham-sandwich cuts
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Geodesic order types
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• On the geodesic centers of polygonal domains
• A linear-time algorithm for the geodesic center of a simple polygon
• Minimum-link paths among obstacles in the plane
• Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
• Translating polygons with applications to hidden surface removal

Cited In (13)

• Implicit convex polygons
• Szlenk indices of convex hulls
• Proximal Voronoï regions, convex polygons, \& leader unform topology
• Explicit convex and concave envelopes through polyhedral subdivisions
• Convex hulls and the Legendre transform
• Title not available (Why is that?)
• The Hausdorff core problem on simple polygons
• Polygon queries for convex hulls of points
• Polynomially convex hulls with piecewise smooth boundaries
• Convex hulls of spatial polygons with a fixed convex projection
• An efficient abstract domain for not necessarily closed polyhedra
• Areas and Intersections in Convex Domains
• Enclosing a polygonal cavity in a two-dimensional bounded domain from Cauchy data

This page was built for publication: Convex hulls in polygonal domains

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