Capturing the shape of a point set with a line segment
From MaRDI portal
Cites work
- 1-Segment Center Problems
- A framework for algorithm stability and its application to kinetic Euclidean MSTs
- A near-linear algorithm for the planar segment-center problem
- A new algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane
- Algorithm AS 136: A K-Means Clustering Algorithm
- Approximating points by a piecewise linear function
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- Bounds on the quality of the PCA bounding boxes
- Computing a Segment Center for a Planar Point Set
- Consistent labeling of rotating maps
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
- Fitting polygonal functions to a set of points in the plane
- Kinetic 2-centers in the black-box model
- Labeling moving points with a trade-off between label speed and label overlap
- New results on stabbing segments with a polygon
- On the shape of a set of points in the plane
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Optimizing active ranges for consistent dynamic map labeling
- Stabbing circles for sets of segments in the plane
- Stabbing line segments
- Stabbing rectangles by line segments -- how decomposition reduces the shallow-cell complexity
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
This page was built for publication: Capturing the shape of a point set with a line segment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241026)
