TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS
From MaRDI portal
Publication:4931734
DOI10.1142/S0218195910003402zbMath1202.65029MaRDI QIDQ4931734
Victor J. Milenkovic, Elisha P. Sacks
Publication date: 30 September 2010
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195910003402
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
Efficient Predicate Evaluation Using Randomized Degeneracy Detection, Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications, Quasi-phi-functions and optimal packing of ellipses, Phi-functions for 2D objects formed by line segments and circular arcs, Optimal clustering of a pair of irregular objects, PLANAR SHAPE MANIPULATION USING APPROXIMATE GEOMETRIC PRIMITIVES
Cites Work
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Vertex-rounding a three-dimensional polyhedral subdivision
- Iterated snap rounding
- Shortest path geometric rounding
- A floating-point technique for extending the available precision
- A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS