An experience of a Geometry Lab based on Mathematica for a Geometry course for Computer Science students, intended to be a basis for later courses in Computer Graphics, CAD and CAGD, is presented....
Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves (2009)
Aloupis, Greg, Collette, Sebastien, Demaine, Erik D., Langerman, Stefan, Sacristan, Vera, Wuhrer, Stefanie
We consider the theoretical model of Crystalline robots, which have been introduced and prototyped by the robotics community. These robots consist of independently manipulable unit-square atoms that...
Small Convex Quadrangulations of Point Sets (2008)
David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan
In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we show that 3b 2 c...
Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado, Marc Noy, Vera Sacristan, ...
We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity (S) of S is given by the smallest number of reflex vertices...
Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado, Marc Noy, Vera Sacristan, ...
We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity (S) of S is given by the smallest number of reflex vertices...
Esther M. Arkin, Martin Held, Vera Sacristan, Steven S. Skiena, Tae-cheon Yang
yy We study some minimum-area hull problems that generalize the notion of convex hull to star-shaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an...
On the reflexivity of point sets (2003)
S Andor, P. Fekete, Esther M. Arkin, Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado, ...
x We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity (S) of S is given by the smallest number of reflex...
On the Reflexivity of Point Sets (2002)
Arkin, Esther M., Fekete, Sandor P., Hurtado, Ferran, Mitchell, Joseph S. B., Noy, Marc, Sacristan, Vera, ...
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity rho(S) of S is given by the smallest number of reflex...
Small Strictly Convex Quadrilateral Meshes of Point Sets (2002)
Bremner, David, Hurtado, Ferran, Ramaswami, Suneeta, Sacristan, Vera
In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we show that...
The weighted farthest color Voronoi diagram on trees and graphs (2002)
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristan
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexity, and provide...
The weighted farthest color Voronoi diagram on trees and graphs (Extended Abstract) (2002)
Ferran Hurtado, Vera Sacristan, Rolf Klein, Elmar Langetepe
Ferran Hurtado, Vera Sacrist an Dept. de Matem atica Aplicada II Univ. Polit ecnica de Catalunya, Barcelona, Spain Rolf Klein, Elmar Langetepe Institut f ur Informatik I Universit at Bonn, Germany...
The weighted farthest color Voronoi diagram on trees and graphs (2002)
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristan
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexity, and provide...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Smallest color-spanning objects (2001)
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, ...
Motivated by questions in location planning, we show for a set of colored points in the plane how to compute the smallest (by perimeter or area) axis-parallel rectangle, the narrowest strip, and...
Some constrained minimax and maximin location problems (2000)
Ferran Hurtado, Vera Sacristan, Departament Matematica, Aplicada Ii, Godfried Toussaint
In this paper we consider constrained versions of the Euclidean minimax facility location problem. We provide an O(n+m) time algorithm for the problem of constructing the minimum enclosing circle of...
Incidence Angle Constrained Visibility (1996)
Gregoria Blanco, Jesus Garcia Lopez, Ferran Hurtado, Pedro Ramos, Vera Sacristan
We present the first part of a study on what we call quality pictures, where we introduce a quality parameter ff that indicates the minimum incidence angle allowed between the vision direction and a...
Esther Arkin, Martin Held, Vera Sacristan, Steven S. Skiena, Tae-cheon Yang
We study some minimum-area hull problems that generalize the notion of convex hull to star-shaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an...
Incidence Angle Constrained Visibility (1996)
Gregoria Blanco, Ferran Hurtado, Pedro Ramos, Vera Sacristan
We present the rst part of a study on what we call quality pictures, where weintroduce a quality parameter that indicates the minimum incidence angle allowed between the vision direction and a seen...
Gregoria Blanco, Ferran Hurtado, Jesus Garcia Lopez, Pedro Ramos, Vera Sacristan
We present the first part of a study on what we call quality pictures, where we introduce a quality parameter ff that indicates the minimum incidence angle allowed between the vision direction and a...