We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in 3D. We do not assume general position. Namely, we handle...
We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in 3D. We do not assume general position. Namely, we handle...
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...
Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
Project co-funded by the European Commission within FP6 (2002–2006) under contract nr. IST-006413 We show how to compute and maintain the two-dimensional arrangement on a quadric that is induced by...
Abstract On the Exact Maximum Complexity of Minkowski Sums of Convex (2008)
Efi Fogel, Dan Halperin, Christophe Weibel
We present a tight bound on the exact maximum complexity of Minkowski sums of convex polyhedra in R3. In particular, we prove that the maximum number of facets of the Minkowski sum of two convex...
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...
CGAL - the Computational Geometry Algorithms Library (2008)
Alliez, Pierre, Fabri, Andreas, Fogel, Efi
The CGAL Open Source Project provides easy access to efficient and reliable geometric algorithms in the form of a C++ library, offering geometric data structures and algorithms, which are efficient,...
CGAL - the Computational Geometry Algorithms Library (2008)
Alliez, Pierre, Fabri, Andreas, Fogel, Efi
The CGAL Open Source Project provides easy access to efficient and reliable geometric algorithms in the form of a C++ library, offering geometric data structures and algorithms, which are efficient,...
Sweeping and maintaining two-dimensional arrangements on surfaces: A first step (2007)
Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
We introduce a general framework for processing a set of curves defined on a continuous two-dimensional parametric surface, while sweeping the parameter space. We can handle planes, cylinders,...
Sweeping and maintaining two-dimensional arrangements on surfaces: A first step (2007)
Eric Berberich, Efi Fogel, Dan Halperin, Ron Wein
We introduce a general framework for processing a set of curves defined on a continuous two-dimensional parametric surface, while sweeping the parameter space. A major goal of our work is to maximize...
On the exact maximum complexity of Minkowski sums of convex polyhedra (2007)
Efi Fogel, Dan Halperin, Christophe Weibel
We present a tight bound on the exact maximum complexity of Minkowski sums of convex polyhedra in R3. In particular, we prove that the maximum number of facets of the Minkowski sum of two convex...
Sweeping and maintaining two-dimensional arrangements on surfaces: A first step (2007)
Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
Abstract. We introduce a general framework for sweeping a set of curves embedded on a two-dimensional parametric surface. We can handle planes, cylinders, spheres, tori, and surfaces homeomorphic to...
On the exact maximum complexity of Minkowski sums of convex polyhedra (2007)
Efi Fogel, Dan Halperin, Christophe Weibel
We present a tight bound on the exact maximum complexity of Minkowski sums of convex polyhedra in R 3. In particular, we prove that the maximum number of facets of the Minkowski sum of two convex...
Sweeping and maintaining two-dimensional arrangements on surfaces: A first step (2007)
Berberich, Eric, Fogel, Efi, Halperin, Dan, Mehlhorn, Kurt, Wein, Ron
Sweeping and maintaining two-dimensional arrangements on quadrics (2007)
Berberich, Eric, Fogel, Efi, Halperin, Dan, Mehlhorn, Kurt, Wein, Ron
Sweeping and maintaining two-dimensional arrangements on surfaces (2007)
Berberich, Eric, Fogel, Efi, Halperin, Dan, Wein, Ron
We introduce a general framework for processing a set of curves defined on a continuous two-dimensional parametric surface, while sweeping the parameter space. A major goal of our work is to maximize...
Exact and efficient construction of Minkowski sums of convex polyhedra with applications (2006)
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...
Exact and efficient construction of Minkowski sums of convex polyhedra with applications (2006)
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...
Advanced programming techniques applied to Cgal’s arrangement package (2005)
Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has been redesigned and...
Advanced programming techniques applied to Cgal’s arrangement package (2005)
Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has been redesigned and...
Advanced programming techniques applied to Cgal’s arrangement package (2005)
Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has been redesigned and...
Video: Exact Minkowski sums of convex polyhedra (2005)
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...
Video: Exact Minkowski sums of convex polyhedra (2005)
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...
Code flexibility and program efficiency by genericity: Improving cgal’s arrangements (2004)
Efi Fogel, Ron Wein, Dan Halperin
Abstract. Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geometry...
Code flexibility and program efficiency by genericity: Improving cgal’s arrangements (2004)
Efi Fogel, Ron Wein, Dan Halperin
Abstract. Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geometry...
A web architecture for progressive delivery of 3d content (2001)
Efi Fogel, Daniel Cohen-or, Revital Ironi, Tali Zvi
In this paper a Web architecture for 3D content delivery is presented. The architecture is based on a progressive compression representation integrated into the X3D framework. The architecture is...
An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs (2000)
Sylvain Pion, Monique Teillaud, Efraim Fogel, Dan Halperin, Ron Wein, Ioannis Emiris, ...
Arrangements of planar curves are fundamental structures in computational geometry.