Relative convex hulls in semi-dynamic arrangements
From MaRDI portal
Recommendations
Cites work
- A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
- Acute triangulations of polygons
- Algorithms for Reporting and Counting Geometric Intersections
- An optimal real-time algorithm for planar convex hulls
- Applications of a semi-dynamic convex hull algorithm
- Approximate Euclidean Shortest Paths in 3-Space
- Arrangements on parametric surfaces. I: General framework and infrastructure
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Efficient partition trees
- Euclidean shortest paths in the presence of rectilinear barriers
- Geodesic disks and clustering in a simple polygon
- Geodesic Fréchet distance inside a simple polygon
- Geodesic ham-sandwich cuts
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- scientific article; zbMATH DE number 2209740 (Why is no real title available?)
- Jacobi curves: computing the exact topology of arrangements of non-singular algebraic curves
- Kinetic collision detection between two simple polygons.
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- Locked and unlocked chains of planar shapes
- Maintenance of configurations in the plane
- Minimum-Perimeter Polygons of Digitized Silhouettes
- Morphing simple polygons
- On separating two simple polygons by a single translation
- On the convex layers of a planar set
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Optimal shortest path queries in a simple polygon
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Ray shooting in polygons using geodesic triangulations
- Refolding planar polygons
- Segment endpoint visibility graphs are Hamiltonian
- Shooting permanent rays among disjoint polygons in the plane
- Straightening polygonal arcs and convexifying polygonal cycles
- Sweeps, arrangements and signotopes
- Tight bounds for connecting sites across barriers
- Topological sweep of the complete graph
- Topologically sweeping an arrangement
- Visibility Algorithms in the Plane
Cited in
(8)- Applications of a semi-dynamic convex hull algorithm
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Relative Convex Hulls in Semi-dynamic Subdivisions
- scientific article; zbMATH DE number 108277 (Why is no real title available?)
- Dynamic geodesic convex hulls in dynamic simple polygons
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
- Nearest neighbor searching in a dynamic simple polygon
- Vertex-colored encompassing graphs
This page was built for publication: Relative convex hulls in semi-dynamic arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476434)
