Pages that link to "Item:Q3578011"
From MaRDI portal
The following pages link to Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon (Q3578011):
Displaying 7 items.
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets (Q662859) (← links)
- A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607) (← links)
- On geodetic sets formed by boundary vertices (Q819808) (← links)
- An algorithm for set operations on nonconvex polygons (with an application to census tracts) (Q1112631) (← links)
- Attraction-convexity and normal visibility (Q1984610) (← links)
- Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
- Relatively convex subsets of simply connected planar sets (Q2480570) (← links)