#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1997

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Clara I. Grima, Alberto Márquez, Lidia M. Ortega
- Comput. Geom.
- 2006

- Nieves Atienza, Natalia de Castro, +11 authors Alexander Wolff
- JoCG
- 2007

We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homo-thetic triangles). We insist that the interiors of the seeds and the cover elements are pairwise disjoint, but they can touch. We call the contact… (More)

- Carmen Cortés, Clara I. Grima, Alberto Márquez, Atsuhiro Nakamoto
- Discrete Mathematics
- 2002

We show that any two outer-triangulations on the same closed surface can be transformed into each other by a sequence of diagonal ips, up to isotopy, if they have a suuciently large and equal number of vertices.

- Mercè Claverol, Delia Garijo, Clara I. Grima, Alberto Márquez, Carlos Seara
- Comput. Geom.
- 2011

The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a… (More)

- C. I. Grima, A. Márquez, L. Ortega
- 2003

Motion planning and visibility problems are some of the most important topics studied in Computer Graphics, Computational Geometry and Robotics. There exits several and important results to these problems. We propose a new approach in this paper using a preprocessing in the plane, the polar diagram. The polar diagram can be considered as a plane… (More)

We show that many classical problems of Computational Geometry can be solved in the cylinder, but planar techniques cannot be adapted always successfully and new techniques must be considered.

- José Cáceres, Clara I. Grima, Alberto Márquez, Auxiliadora Moreno-González
- Networks
- 2007

The dilation-free graph of a planar point set S is a graph that spans S in such a way that the distance between two points in the graph is no longer than their planar distance. Metrically speaking, those graphs are equivalent to complete graphs; however they have far fewer edges when considering the Manhattan distance (we give here an upper bound on the… (More)

- Delia Garijo, Maria Angeles Garrido, +6 authors Jesus Valenzuela
- Inf. Process. Lett.
- 2014

- Delia Garijo, Maria Angeles Garrido, +6 authors Jesus Valenzuela
- Electronic Notes in Discrete Mathematics
- 2009