On-line construction of the convex hull of a simple polyline
From MaRDI portal
Cites work
Cited in
(52)- Parameter identification of 1D fractal interpolation functions using bounding volumes
- A simple algorithm for determining the envelope of a set of lines
- An efficient algorithm for finding the CSG representation of a simple polygon
- Cartographic line simplification and polygon CSG formulae in O(n^* n) time
- Stabbing information of a simple polygon
- Numerical stability of a convex hull algorithm for simple polygons
- A workbench for computational geometry
- Geometric preservation of 2D digital objects under rigid motions
- Optimizing squares covering a set of points
- On computing the convex hull of (piecewise) curved objects
- Attraction-convexity and normal visibility
- Optimizing generalized kernels of polygons
- Optimal placement of base stations in border surveillance using limited capacity drones
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
- Covering paths for planar point sets
- Efficient observer-dependent simplification in polygonal domains
- Three problems about simple polygons
- The Erdős--Nagy theorem and its ramifications
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Linear segmentation of discrete curves into blurred segments
- Optimizing squares covering a set of points
- Computational and structural advantages of circular boundary representation
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Adaptive planar point location
- Filling polyhedral molds
- Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time
- Geodesic-preserving polygon simplification
- Tangential Cover for Thick Digital Curves
- Polygons cuttable by a circular saw
- Dynamic convex hulls under window-sliding updates
- scientific article; zbMATH DE number 7685241 (Why is no real title available?)
- Optimal Area Polygonization by Triangulation and Visibility Search
- The rectilinear convex hull of line segments
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Algorithms for subpath convex hull queries and ray-shooting among segments
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
- Online multivariate changepoint detection: leveraging links with computational geometry
- Dynamic convex hulls for simple paths
- Dynamic convex hulls under window-sliding updates
- Inner -approximation of the convex hull of finite sets
- Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
- Augmenting plane straight-line graphs to meet parity constraints
- Dynamic convex hulls for simple paths
- Measure of circularity for parts of digital boundaries and its fast computation
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Lyndon + Christoffel = digitally convex
- Tangential cover for thick digital curves
- A simple algorithm for digital line recognition in the general case
- A new algorithm for computing the convex hull of a planar point set
- Optimal simplification of polygonal chains for subpixel-accurate rendering
- Triangulating input-constrained planar point sets
This page was built for publication: On-line construction of the convex hull of a simple polyline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107996)
