MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
From MaRDI portal
Publication:4848831
DOI10.1142/S0218195995000143zbMATH Open0834.68119OpenAlexW2104800753MaRDI QIDQ4848831FDOQ4848831
Authors: David Rappaport 
Publication date: 20 September 1995
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195995000143
Recommendations
- Minimum-perimeter intersecting polygons
- Minimum-perimeter intersecting polygons
- Minimum rectilinear polygons for given angle sequences
- Minimum rectilinear polygons for given angle sequences
- Publication:3484818
- On the minimality of polygon triangulation
- Minimum vertex distance between separable convex polygons
- Minimum polygonal separation
- scientific article; zbMATH DE number 2079748
- Minimizing the number of lattice points in a translated polygon
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (22)
- Largest and smallest convex hulls for imprecise points
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Stabbers of line segments in the plane
- Minimum-perimeter intersecting polygons
- Algorithms for interval structures with applications
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
- Minimal surface convex hulls of spheres
- Stabbing circles for sets of segments in the plane
- On intersecting a set of parallel line segments with a convex polygon of minimum area
- Minimum-perimeter intersecting polygons
- Clustering geometrically-modeled points in the aggregated uncertainty model
- COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON
- New results on stabbing segments with a polygon
- The touring rays and related problems
- Polynomial-time algorithms for the touring rays and related problems
- COMPUTING SHORTEST TRANSVERSALS OF SETS
- ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA
- Minimizing the number of lattice points in a translated polygon
- The traveling salesman problem for lines and rays in the plane
- Finding transversals for sets of simple geometric figures
- Algorithms for interval structures with applications
- Efficient algorithm for transversal of disjoint convex polygons.
This page was built for publication: MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4848831)
