Pages that link to "Item:Q1816462"
From MaRDI portal
The following pages link to Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462):
Displaying 15 items.
- Skyline Computation with Noisy Comparisons (Q5041199) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- (Q5091039) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
- Techniques and Open Questions in Computational Convex Analysis (Q5746453) (← links)
- Linear-Time Convexity Test for Low-Order Piecewise Polynomials (Q5857296) (← links)
- An alternative definition for digital convexity (Q5918416) (← links)
- Maximizing dominance in the plane and its applications (Q5925538) (← links)
- An alternative definition for digital convexity (Q5925581) (← links)
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449) (← links)
- Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane (Q6162513) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
- Incremental convex hull algorithms are not output sensitive (Q6487422) (← links)
- Witnessing subsystems for probabilistic systems with low tree width (Q6649513) (← links)
