Reconstructing polygons from scanner data
From MaRDI portal
Publication:553352
Recommendations
Cites work
- scientific article; zbMATH DE number 4062601 (Why is no real title available?)
- scientific article; zbMATH DE number 8793 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Closed object boundaries from scattered points
- Covering oriented points in the plane with orthogonal polygons is NP-complete
- Curve and Surface Reconstruction
- Generating random polygons with given vertices
- Hamilton Paths in Grid Graphs
- Linear Programming in Linear Time When the Dimension Is Fixed
- Matching theory
- Paths, Trees, and Flowers
- Reconstructing polygons from scanner data
- Surface reconstruction by Voronoi filtering
- The complexity of detecting crossingfree configurations in the plane
- The power crust, unions of balls, and the medial axis transform
Cited in
(10)- Area bounds of rectilinear polygons realized by angle sequences
- Non-interactive geometric probing: Reconstruction non-convex polygons
- A drone can hear the shape of a room
- Covering points with minimum/maximum area orthogonally convex polygons
- Minimum rectilinear polygons for given angle sequences
- An improved algorithm for reconstructing a simple polygon from its visibility angles
- Minimum rectilinear polygons for given angle sequences
- Reconstructing polygons from scanner data
- Reconstruction of Weakly Simple Polygons from Their Edges
- On representing a simple polygon perceivable to a blind person
This page was built for publication: Reconstructing polygons from scanner data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553352)