Article

Exact minkowski sums and applications

Authors:

Eyal Flato,

Efi Fogel,

Dan Halperin,

Eran LeiserowitzAuthors Info & Claims

SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry

Pages 273 - 274

https://doi.org/10.1145/513400.513432

Published: 05 June 2002 Publication History

Get Access

Abstract

(MATH) The Minkowski sum of two sets P and Q in $\reals^d is the set (p+q \mid p Ε P, q Ε Q). Minkowski sums are useful in robot motion planning, computer-aided design and manufacturing (CAD/CAM) and many other areas. In this video we present a software package implemented at Tel Aviv University for the exact and efficient construction of Minkowski sums of planar sets. We also explain and demonstrate how Minkowski sums are used in various applications.

References

[1]

P. K. Agarwal, E. Flato, and D. Halperin. Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Theory Appl., 21:39--61, 2002.]]

Digital Library

Google Scholar

[2]

G. Elber and M.-S. Kim, editors. Special Issue of Computer Aided Design: Offsets, Sweeps and Minkowski Sums, volume 31. 1999.]]

Google Scholar

[3]

E. Flato. Robust and efficient construction of planar Minkowski sums. Master's thesis, Dept. Comput. Sci., Tel-Aviv Univ., 2000. http://www.cs.tau.ac.il/~flato.]]

Google Scholar

[4]

E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, and E. Ezra. The design and implementation of planar maps in CGAL. The ACM Journal of Experimental Algorithmics, 5, 2000. Also in LNCS Vol. 1668 (WAE '99), Springer, pp. 154--168.]]

Digital Library

Google Scholar

[5]

D. Halperin. Robust geometric computing in motion. In B. Donald, K. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Dimensions (WAFR '00), pages 9--22. A. K. Peters, Wellesley, MA, 2001. To appear in International Journal of Robotics Research.]]

Google Scholar

[6]

D. Halperin, J.-C. Latombe, and R. H. Wilson. A general framework for assembly planning: The motion space approach. Algorithmica, 26:577--601, 2000.]]

Crossref

Google Scholar

[7]

I. Hanniel and D. Halperin. Two-dimensional arrangements in CGAL and adaptive point location for parametric curves. In Proc. of the 4th Workshop of Algorithm Engineering, volume 1982 of Lecture Notes Comput. Sci., pages 171--182. Springer-Verlag, 2000.]]

Digital Library

Google Scholar

[8]

J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.]]

Digital Library

Google Scholar

[9]

K. Melhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.]]

Digital Library

Google Scholar

Cited By

View all

Vinodhini MAmeena Bibi N(2022)Haze image restoration based on physical optics model using raspberry pi B+V1.2Materials Today: Proceedings10.1016/j.matpr.2020.05.17348(155-159)Online publication date: 2022
https://doi.org/10.1016/j.matpr.2020.05.173
Fu HWu BShao YZhang H(2018)Perception Oriented Haze Image Definition Restoration by Basing on Physical Optics ModelIEEE Photonics Journal10.1109/JPHOT.2018.283701010:3(1-16)Online publication date: Jul-2018
https://doi.org/10.1109/JPHOT.2018.2837010
Décoret XDebunne GSillion FDutré PSuykens FChristensen PCohen-Or D(2003)Erosion based visibility preprocessingProceedings of the 14th Eurographics workshop on Rendering10.5555/882404.882444(281-288)Online publication date: 25-Jun-2003
https://dl.acm.org/doi/10.5555/882404.882444

Index Terms

Exact minkowski sums and applications

Recommendations

Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes

It is known that in the Minkowski sum of r polytopes in dimension d, with r

In this paper, we study sums of polytopes and prove a linear relation between the number of faces of a sum of r polytopes in dimension d, with rźd, and the number of faces in ...
Topological obstructions for vertex numbers of Minkowski sums

We show that for polytopes P"1,P"2,...,P"r@?R^d, each having n"i>=d+1 vertices, the Minkowski sum P"1+P"2+...+P"r cannot achieve the maximum of @?"in"i vertices if r>=d. This complements a recent result of Fukuda and Weibel (2006), who show that this is ...
Exact and efficient construction of Minkowski sums of convex polyhedra with applications

We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R^3. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it ...

Comments

Information & Contributors

Information

Published In

SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry

June 2002

330 pages

ISBN:1581135041

DOI:10.1145/513400

Conference Chairs:
Ferran Hurtado
Universitat Politècnica de Catalunya
,
Vera Sacristán
Universitat Politècnica de Catalunya
,
Program Chairs:
Chandrajit Bajaj
University of Texas at Austin
,
Subhash Suri
University of California at Santa Barbara

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 June 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SoCG02

Sponsor:

SoCG02: The 18th Annual ACM Symposium on Computational Geometry

June 5 - 7, 2002

Barcelona, Spain

Acceptance Rates

SCG '02 Paper Acceptance Rate 35 of 104 submissions, 34%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
59
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vinodhini MAmeena Bibi N(2022)Haze image restoration based on physical optics model using raspberry pi B+V1.2Materials Today: Proceedings10.1016/j.matpr.2020.05.17348(155-159)Online publication date: 2022
https://doi.org/10.1016/j.matpr.2020.05.173
Fu HWu BShao YZhang H(2018)Perception Oriented Haze Image Definition Restoration by Basing on Physical Optics ModelIEEE Photonics Journal10.1109/JPHOT.2018.283701010:3(1-16)Online publication date: Jul-2018
https://doi.org/10.1109/JPHOT.2018.2837010
Décoret XDebunne GSillion FDutré PSuykens FChristensen PCohen-Or D(2003)Erosion based visibility preprocessingProceedings of the 14th Eurographics workshop on Rendering10.5555/882404.882444(281-288)Online publication date: 25-Jun-2003
https://dl.acm.org/doi/10.5555/882404.882444

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes

Topological obstructions for vertex numbers of Minkowski sums

Exact and efficient construction of Minkowski sums of convex polyhedra with applications