Space-efficient planar convex hull algorithms
From MaRDI portal
Publication:596137
Recommendations
Cites work
- scientific article; zbMATH DE number 4062610 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A New Convex Hull Algorithm for Planar Sets
- An efficient algorithm for determining the convex hull of a finite planar set
- An introduction to three algorithms for sorting in situ
- An optimal real-time algorithm for planar convex hulls
- Another efficient algorithm for convex hulls in two dimensions
- Applications of random sampling in computational geometry. II
- Convex hulls of finite sets of points in two and three dimensions
- Enumerating extreme points in higher dimensions
- In-place sorting with fewer moves
- Linear Programming in Linear Time When the Dimension Is Fixed
- Maintenance of configurations in the plane
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
- On the identification of the convex hull of a finite set of points in the plane
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Output-sensitive results on convex hulls, extreme points, and related problems
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
- Programming as a Discipline of Mathematical Nature
- Randomized quickhull
- Simplified stable merging tasks
- Small-dimensional linear programming and convex hulls made easy
- Smoothsort, an alternative for sorting in situ
- Sorting a Random Access File in situ
- Stable Linear Time Sublinear Space Merging
- Stable in situ sorting and minimum data movement
- Stable minimum space partitioning in linear time
- The Ultimate Planar Convex Hull Algorithm?
- Unstable linear time O(1) space merging
Cited in
(20)- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- scientific article; zbMATH DE number 7561401 (Why is no real title available?)
- Minimum dominating set problem for unit disks revisited
- In-place algorithms for computing (Layers of) maxima
- A new algorithm for computing the convex hull of a planar point set
- LATIN 2004: Theoretical Informatics
- Convex-hull algorithms: implementation, testing, and experimentation
- Memory-constrained algorithms for simple polygons
- scientific article; zbMATH DE number 2086251 (Why is no real title available?)
- Optimal time-space tradeoff for the 2D convex-hull problem
- An in-place algorithm for Klee's measure problem in two dimensions
- Line-segment intersection made in-place
- Space-efficient geometric divide-and-conquer algorithms
- Synergistic solutions for merging and computing planar convex hulls
- Reprint of: Memory-constrained algorithms for simple polygons
- A new active convex hull model for image regions
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Prune-and-search with limited workspace
- An efficient convex hull algorithm using affine transformation in planar point set
- Convex hull properties and algorithms
This page was built for publication: Space-efficient planar convex hull algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596137)
