Pages that link to "Item:Q1196456"
From MaRDI portal
The following pages link to Applications of a semi-dynamic convex hull algorithm (Q1196456):
Displaying 30 items.
- On inducing polygons and related problems (Q359751) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Connectivity guarantees for wireless networks with directional antennas (Q654284) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Boundary labeling: Models and efficient algorithms for rectangular maps (Q868108) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Bipartite embeddings of trees in the plane (Q1296568) (← links)
- An optimal algorithm for plane matchings in multipartite geometric graphs (Q1616235) (← links)
- On Hamiltonian alternating cycles and paths (Q1699287) (← links)
- On embedding an outer-planar graph in a point set (Q1862133) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Isotonic regression for multiple independent variables (Q2346967) (← links)
- Weighted \(L_{\infty}\) isotonic regression (Q2409576) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- INDUCING POLYGONS OF LINE ARRANGEMENTS (Q3089096) (← links)
- An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs (Q3449806) (← links)
- On Map Labeling with Leaders (Q3644729) (← links)
- Convex hull of a planar set of straight and circular line segments (Q4484714) (← links)
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS (Q4818568) (← links)
- Spiral Serpentine Polygonization of a Planar Point Set (Q4899273) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
