Planning corridors among obstacles has arisen as a central problem in game design. Instead of devising a one-dimensional motion path for a moving entity, it is possible to let it move in a corridor,...
Planning corridors among obstacles has arisen as a central problem in game design. Instead of devising a one-dimensional motion path for a moving entity, it is possible to let it move in a corridor,...
Exact and Efficient Construction of Planar Minkowski Sums using the Convolution Method ∗ (2008)
The Minkowski sum of two sets A, B ∈ IR d, denoted A⊕B, is defined as {a + b | a ∈ A, b ∈ B}. We describe an efficient and robust implementation for the construction of Minkowski sums of...
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...
We introduce a new type of diagram called the VV (c)-diagram (the Visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diagram of polygons in...
www.cs.uu.nl The Visibility–Voronoi Complex and Its Applications ∗ (2008)
Ron Wein, Dan Halperin, Ron Wein, Dan Halperin
We introduce a new type of diagram called the VV (c)-diagram (the Visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diagram of polygons in...
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design. In this paper we...
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...
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...
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...
Planning near-optimal corridors amidst obstacles (2006)
Abstract: Planning corridors among obstacles has arisen as a central problem in game design. Instead of devising a one-dimensional motion path for a moving entity, it is possible to let it move in a...
The Visibility-Voronoi complex and its applications (2005)
We introduce a new type of diagram called the VV (c)-diagram (the Visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diagram of polygons in...
The Visibility-Voronoi complex and its applications (2005)
Ron Wein, Jur P. Berg, Dan Halperin
We introduce a new type of diagram called the VV (c)-diagram (the Visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diagram of polygons in...
Efficient implementation of red-black trees with split and catenate operations (2005)
We describe the implementation of the Multiset class-template within the support library of Cgal, the Computational Geometry Algorithms ’ Library. The interface of this class is inspired by the...
Ron Wein, Dan Halperin, R. Wein, O. Ilushin, G. Elber, D. Halperin
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter continuously moves near...
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...
The Visibility-Voronoi complex and its applications (2005)
We introduce a new type of diagram called the VV (c)-diagram (the Visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diagram of polygons in...
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...
The Visibility-Voronoi complex and its applications (2005)
Ron Wein, Jur P. Berg, Dan Halperin
Abstract We introduce a new type of diagram called the VV(c)-diagram (the Visibility-Voronoi dia-gram for clearance c), which is a hybrid between the visibility graph and the Voronoi diagramof...
An empirical comparison of software for constructing arrangements of curved arcs (2004)
Berberich,Eric, Eigenwillig,Arno, Emiris,Ioannis, Fogel,Efraim, Hemmer,Michael, Halperin,Dan, ...
An empirical comparison of software for constructing arrangements of curved arcs (2004)
Berberich, Eric, Eigenwillig, Arno, Emiris, Ioannis, Fogel, Efraim, Hemmer, Michael, Halperin, Dan, ...
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...
Precise global collision detection in multi-axis NCmachining (2004)
Oleg Ilushin, Gershon Elber, Dan Halperin, Ron Wein
We introduce a new approach to the problem of collision detection in multi-axis NC-machining. Due to the directional nature (tool axis) of multi-axis NC-machining, space subdivision techniques are...
Continuous path verification in multi-axis NC-machining (2004)
Ron Wein, Gershon Elber, Oleg Ilushin, Dan Halperin
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter continuously moves near...
High-level filtering for arrangements of conic arcs (2002)
Abstract. Many computational geometry algorithms involve the construction and maintenance of planar arrangements of conic arcs. Implementing a general, robust arrangement package for conic arcs...
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.