#### Filter Results:

- Full text PDF available (168)

#### Publication Year

1969

2018

- This year (6)
- Last 5 years (39)
- Last 10 years (86)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia
- DIAL-M
- 1999

We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than someâ€¦ (More)

- Evangelos Kranakis, Harvinder Singh, Jorge Urrutia
- CCCG
- 1999

Suppose that a traveler arrives in the city of Toronto, and wants to walk to the famous CN Tower, one of the tallest free-standing structures in the world. Our visitor, lacking a map of Toronto, isâ€¦ (More)

- Jorge Urrutia
- 2000

How many guards are necessary, and how many are sufficient to patrol the paintings and works of art in an art gallery with n walls? This wonderfully naÂ¨Ä±ve question of combinatorial geometry has,â€¦ (More)

- Ferran Hurtado, Marc Noy, Jorge Urrutia
- Symposium on Computational Geometry
- 1996

In this paper we study the problem of flipping edges in triangulations of polygons and point sets. We prove that if a polygon Qn has k reflex vertices, then arty triangulation T of Q. can beâ€¦ (More)

- Martin Charles Golumbic, Doron Rotem, Jorge Urrutia
- Discrete Mathematics
- 1983

A function diagram (f-diagram) D consists of the family of curves {i, . . . , ii} obtained from n continuous functions fi : [O, 1] -B R (1 G i d n). We call the intersection graph of D a functionâ€¦ (More)

- JÃ©rÃ´me Galtier, Ferran Hurtado, Marc Noy, StÃ©phane PÃ©rennes, Jorge Urrutia
- Int. J. Comput. Geometry Appl.
- 2003

We generalize the operation of flipping an edge in a triangulation to that of flipping several edges simultaneously. Our main result is an optimal upper bound on the number of simultaneous flips thatâ€¦ (More)

- Jurek Czyzowicz, Evangelos Kranakis, +6 authors Mohammadreza Yazdani
- ADHOC-NOW
- 2010

A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensors in arbitraryâ€¦ (More)

- Manuel Abellanas, Alfredo GarcÃa Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia
- Comput. Geom.
- 2008

Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected plane geometricâ€¦ (More)

- Edgar ChÃ¡vez, Stefan Dobrev, +4 authors Jorge Urrutia
- OPODIS
- 2005

We give a new local test, called a Half-Space Proximal or HSP test, for extracting a sparse directed or undirected subgraph of a given unit disk graph. The HSP neighbors of each vertex are unique,â€¦ (More)

- Jurek Czyzowicz, Evangelos Kranakis, +6 authors Mohammadreza Yazdani
- ADHOC-NOW
- 2009

We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the line. An intruderâ€¦ (More)