Constant workspace algorithms for computing relative hulls in the plane

DOI10.1142/S0218195925500062MaRDI QIDQ6850071zbMATH OpenFDO

Authors Himanshu Chhabra, Rajasekhar Inkulu

Publication date 3 March 2026

Published in International Journal of Computational Geometry \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195925500062

zbMATH Keywords

computational geometryrelative hullsspace-efficient algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A time-space trade-off for computing the k-visibility region of a point in a polygon
• An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
• An optimal algorithm for the separating common tangents of two polygons
• Computational geometry. Algorithms and applications.
• Constant-work-space algorithms for geometric problems
• Constant-work-space algorithms for shortest paths in trees and simple polygons
• Euclidean shortest paths in the presence of rectilinear barriers
• scientific article; zbMATH DE number 2086251 (Why is no real title available?)
• scientific article; zbMATH DE number 5764826 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Improved time-space trade-offs for computing Voronoi diagrams
• In-place algorithms for computing (Layers of) maxima
• Memory-constrained algorithms for simple polygons
• On separating two simple polygons by a single translation
• On the identification of the convex hull of a finite set of points in the plane
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Optimal time-space tradeoff for the 2D convex-hull problem
• Relative convex hull determination from convex hulls in the plane
• Shortest Path in a Polygon using Sublinear Space.
• Space-time trade-offs for stack-based algorithms
• The Ultimate Planar Convex Hull Algorithm?
• Time-space trade-offs for computing Euclidean minimum spanning trees
• Time-space trade-offs for triangulating a simple polygon
• Time-space trade-offs for triangulations and Voronoi diagrams
• Towards in-place geometric algorithms and data structures
• Undirected connectivity in log-space

This page was built for publication: Constant workspace algorithms for computing relative hulls in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6850071)