Silveira, Rodrigo Ignacio
Total activity: 54

## Scientific and technological production Ordered by:  Date asc. Date desc. Title asc. Title desc. Researcher asc. Researcher desc.

1 to 50 of 54 results
• Computing correlation between piecewise-linear functions

Agarwal, Pankaj; Aronov, Boris; Van Kreveld, Matias; Löffler, Maarten; Silveira, Rodrigo Ignacio
SIAM journal on computing
Date of publication: 2013
Journal article

We study the problem of computing correlation between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in three dimensions---polyhedral terrains---can be transformed vertically by a linear transformation of the third coordinate (scaling and translation). We present a randomized algorithm that minimizes the maximum vertical distance between the graphs of the two functions, over all linear transformations of one of the terrains, in $O(n^{4/3}\operatorname{polylog}n)$ expected time, where $n$ is the total number of vertices in the graphs of the two functions. We also present approximation algorithms for minimizing the mean distance between the graphs of univariate and bivariate functions. For univariate functions we present a $(1+\varepsilon)$-approximation algorithm that runs in $O(n (1 + \log^2 (1/\varepsilon)))$ expected time for any fixed $\varepsilon >0$. The $(1+\varepsilon)$-approximation algorithm for bivariate functions runs in $O(n/\varepsilon)$ time, for any fixed $\varepsilon >0$, provided the two functions are defined over the same triangulation of their domain.

• Flow computations on imprecise terrains

Driemel, Anne; Haverkort, Herman; Löffler, Maarten; Silveira, Rodrigo Ignacio
Journal of Computational Geometry
Date of publication: 2013
Journal article

We study water flow computation on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and one where water only flows along the edges of a predened graph, for example a grid or a triangulation. In both cases each vertex has an imprecise elevation, given by an interval of possible values, while its (x; y)-coordinates are fixed. For the first model, we show that the problem of deciding whether one vertex may be contained in the watershed of another is NP-hard. In contrast, for the second model we give a simple O(n log n) time algorithm to compute the minimal and the maximal watershed of a vertex, or a set of vertices, where n is the number of edges of the graph. On a grid model, we can compute the same in O(n) time.

We study water flow computation on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and one where water only flows along the edges of a prede ned graph, for example a grid or a triangulation. In both cases each vertex has an imprecise elevation, given by an interval of possible values, while its (x; y)-coordinates are fi xed. For the fi rst model, we show that the problem of deciding whether one vertex may be contained in the watershed of another is NP-hard. In contrast, for the second model we give a simple O(n log n) time algorithm to compute the minimal and the maximal watershed of a vertex, or a set of vertices, where n is the number of edges of the graph. On a grid model, we can compute the same in O(n) time.

• Colored spanning graphs for set visualization

Hurtado Diaz, Fernando Alfredo; Korman Cozzetti, Matias; Van Kreveld, Matias; Löffler, Maarten; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio; Speckmann, Bettina
Symposium on Graph Drawing
Presentation's date: 2013-09
Presentation of work at congresses

We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points belong exclusively to the red set, and purple points belong to both sets. A red-blue-purple spanning graph (RBP spanning graph) is a set of edges connecting the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we show that the general problem is NP-hard. Hence we give an (1/2¿+1)-approximation, where ¿ is the Steiner ratio. We also present efficient exact solutions if the points are located on a line or a circle. Finally we consider extensions to more than two sets.

We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points belong exclusively to the red set, and purple points belong to both sets. A red-blue-purple spanning graph (RBP spanning graph) is a set of edges connecting the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we show that the general problem is NP-hard. Hence we give an (1/2¿+1)-approximation, where ¿ is the Steiner ratio. We also present efficient exact solutions if the points are located on a line or a circle. Finally we consider extensions to more than two sets.

• Stabbing Segments with Rectilinear Objects

Claverol Aguas, Merce; Seara Ojea, Carlos; Garijo, Delia; Korman Cozzetti, Matias; Silveira, Rodrigo Ignacio
Mexican Conference on Discrete Mathematics and Computational Geometry
Presentation's date: 2013-11-13
Presentation of work at congresses

Given a set of n line segments in the plane, we say that a region R of the plane is a stabber if R contains exactly one end point of each segment of the set. In this paper we provide efficient algorithms for determining wheter or not a stabber exists for several shapes of stabbers. Specially, we consider the case in which the stabber can be described as the intersecction of isothetic halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). We provided efficient algorithms reporting all combinatorially different stabbers of the shape. The algorithms run in O(n) time (for the halfplane case), O(n logn) time (for strips and quadrants), O(n^2) (for 3-sided rectangles), or O(n^3) time (for rectangles).

Given a set of n line segments in the plane, we say that a region R of the plane is a stabber if R contains exactly one end point of each segment of the set. In this paper we provide efficient algorithms for determining wheter or not a stabber exists for several shapes of stabbers. Specially, we consider the case in which the stabber can be described as the intersecction of isothetic halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). We provided efficient algorithms reporting all combinatorially different stabbers of the shape. The algorithms run in O(n) time (for the halfplane case), O(n logn) time (for strips and quadrants), O(n^2) (for 3-sided rectangles), or O(n^3) time (for rectangles).

• New results on stabbing segments with a polygon

Díaz Bañez, José Miguel; Korman Cozzetti, Matias; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio
International Conference on Algorithms and Complexity
Presentation's date: 2013-05
Presentation of work at congresses

We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon P if at least one of its two endpoints is contained in P. A segment set S is stabbed by P if every segment of S is stabbed by P. We show that if S is a set of pairwise disjoint segments, the problem of computing the minimum perimeter polygon stabbing S can be solved in polynomial time. We also prove that for general segments the problem is NP-hard. Further, an adaptation of our polynomial-time algorithm solves an open problem posed by Löffler and van Kreveld [Algorithmica 56(2), 236-269 (2010)] about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments.

We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon P if at least one of its two endpoints is contained in P. A segment set S is stabbed by P if every segment of S is stabbed by P. We show that if S is a set of pairwise disjoint segments, the problem of computing the minimum perimeter polygon stabbing S can be solved in polynomial time. We also prove that for general segments the problem is NP-hard. Further, an adaptation of our polynomial-time algorithm solves an open problem posed by Löffler and van Kreveld [Algorithmica 56(2), 236-269 (2010)] about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments.

• Drawing (complete) binary tanglegrams hardness, approximation, fixed-parameter tractability

Buchin, Kevin; Buchin, Maike; Byrka, Jaroslaw; Noellenburg, Martin; Okamoto, Yoshio; Silveira, Rodrigo Ignacio; Wolff, Alexander
Algorithmica
Date of publication: 2012-02
Journal article

• Median trajectories

Buchin, Kevin; Buchin, Maike; Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio; Wenk, Carola; Wiratma, Lionov
Algorithmica
Date of publication: 2012-05
Journal article

We investigate the concept of a median among a set of trajectories. We establish criteria that a “median trajectory” should meet, and present two different methods to construct a median for a set of input trajectories. The first method is very simple, while the second method is more complicated and uses homotopy with respect to sufficiently large faces in the arrangement formed by the trajectories. We give algorithms for both methods, analyze the worst-case running time, and show that under certain assumptions both methods can be implemented efficiently. We empirically compare the output of both methods on randomly generated trajectories, and evaluate whether the two methods yield medians that are according to our intuition. Our results suggest that the second method, using homotopy, performs considerably better.

Postprint (author’s final draft)

• Removing local extrema from imprecise terrains

Gray, Chris; Kammer, Frank; Löffler, Maarten; Silveira, Rodrigo Ignacio
Computational geometry: theory and applications
Date of publication: 2012-08
Journal article

In this paper we consider imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. In particular, we study the problem of removing as many local extrema (minima and maxima) as possible from the terrain; that is, fi nding an assignment of one height to each vertex, within its error interval, so that the resulting terrain has minimum number of local extrema. We show that removing only minima or only maxima can be done optimally in O(n log n) time, for a terrain with n vertices. Interestingly, however, the problem of fi nding a height assignment that minimizes the total number of local extrema (minima as well as maxima) is NP-hard, and is even hard to approximate within a factor of O(log log n) unless P = NP. Moreover, we show that even a simpli ed version of the problem where we can have only three di fferent types of intervals for the vertices is already NP-hard, a result we obtain by proving hardness of a special case of 2-Disjoint Connected Subgraphs, a problem that has lately received considerable attention from the graph-algorithms community.

• Processing aggregated data : the location of clusters in health data

Buchin, Kevin; Buchin, Maike; Kreveld, Marc van; Löffler, Maarten; Luo, Jun; Silveira, Rodrigo Ignacio
Geoinformatica
Date of publication: 2012-07
Journal article

Spatially aggregated data is frequently used in geographical applications. Often spatial data analysis on aggregated data is performed in the same way as on exact data, which ignores the fact that we do not know the actual locations of the data. We here propose models and methods to take aggregation into account. For this we focus on the problem of locating clusters in aggregated data. More specifically, we study the problem of locating clusters in spatially aggregated health data. The data is given as a subdivision into regions with two values per region, the number of cases and the size of the population at risk. We formulate the problem as finding a placement of a cluster window of a given shape such that a cluster function depending on the population at risk and the cases is maximized. We propose area-based models to calculate the cases (and the population at risk) within a cluster window. These models are based on the areas of intersection of the cluster window with the regions of the subdivision. We show how to compute a subdivision such that within each cell of the subdivision the areas of intersection are simple functions. We evaluate experimentally how taking aggregation into account influences the location of the clusters found.

• Improving shortest paths in the Delaunay triangulation

Claverol Aguas, Merce; Hernández Peñalver, Gregorio; Hurtado Diaz, Fernando Alfredo; Sacristán Adinolfi, Vera; Saumell, Maria; Silveira, Rodrigo Ignacio; Abellanas, Manuel
International journal of computational geometry and applications
Date of publication: 2012
Journal article

We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set S, we look for a new point p ¿ S that can be added, such that the shortest path from s to t, in the Delaunay triangulation of S¿{p}, improves as much as possible. We study several properties of the problem, and give efficient algorithms to find such a point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed.

We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set P, we look for a new point p that can be added, such that the shortest path from s to t, in the Delaunay triangulation of P ∪ {p}, improves as much as possible. We study several properties of the problem, and give efficient algorithms to find such point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed.

• Bichromatic 2-center of pairs of points

Arkin, Esther M.; Díaz Bañez, José Miguel; Hurtado Diaz, Fernando Alfredo; Kumar, Piyush; Mitchell, Joseph S. B.; Palop, Belén; Pérez Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo Ignacio
Latin American Symposium on Theoretical Informatics
Presentation's date: 2012-04-19
Presentation of work at congresses

• Embedding rivers in triangulated irregular networks with linear programming

Kreveld, Marc van; Silveira, Rodrigo Ignacio
International journal of geographical information science
Date of publication: 2011
Journal article

• Peeling meshed potatoes

Aronov, Boris; Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio
Algorithmica
Date of publication: 2011
Journal article

• Connect the dot: computing feed-links for network extension

Aronov, Boris; Buchin, Kevin; Buchin, Maike; Jansen, Bart; De Jong, Tom; Kreveld, Marc van; Loffler, Maarten; Luo, Jun; Silveira, Rodrigo Ignacio; Speckmann, Bettina
Journal of Spatial Information Science
Date of publication: 2011-12-20
Journal article

• On the number of higher order Delaunay triangulations

Mitsche, Dieter Wilhelm; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio
Theoretical computer science
Date of publication: 2011-07-01
Journal article

• MATHEMATICAL FOUNDATIONS OF HIGH QUALITY TERRAIN MODELS

Silveira, Rodrigo Ignacio; Hurtado Diaz, Fernando Alfredo
Participation in a competitive project

• Puntos y grafos: puentes geométricos (IP04 en CRP Comb. of points sets, ComPoSe,EuroGIGA ESF)

Claverol Aguas, Merce; Dall, Aaron Matthew; Silveira, Rodrigo Ignacio; Huemer, Clemens; Mora Gine, Mercè; Sacristán Adinolfi, Vera; Hernando Martin, Maria Del Carmen; Seara Ojea, Carlos; Montes Lozano, Antonio; Hurtado Diaz, Fernando Alfredo
Participation in a competitive project

Buchin, Kevin; Eppstein, David; Löffler, Maarten; Nöllenburg, Martin; Silveira, Rodrigo Ignacio
Workshop on Algorithms and Data Structures
Presentation's date: 2011-08-16
Presentation of work at congresses

• Improving shortest paths in the Delaunay triangulation

Claverol Aguas, Merce; Hernández Peñalver, Gregorio; Hurtado Diaz, Fernando Alfredo; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio; Abellanas, Manuel
European Workshop on Computational Geometry
Presentation's date: 2011-03-28
Presentation of work at congresses

• Computing a visibility polygon using few variables

Barba, Luis; Korman Cozzetti, Matias; Langerman, Stefan; Silveira, Rodrigo Ignacio
International Symposium on Algorithms and Computation
Presentation's date: 2011-12-05
Presentation of work at congresses

• Improving shortest paths in the Delaunay triangulation

Claverol Aguas, Merce; Hernández, Gregorio; Hurtado Diaz, Fernando Alfredo; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio; Abellanas, Manuel
Spanish Meeting on Computational Geometry
Presentation's date: 2011-06-28
Presentation of work at congresses

• Flow computations on imprecise terrains

Driemel, Anne; Haverkort, Herman; Löffler, Maarten; Silveira, Rodrigo Ignacio
Workshop on Algorithms and Data Structures
Presentation's date: 2011-08-15
Presentation of work at congresses

We study water flow computation on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and one where water only flows along the edges of a predefined graph, for example a grid or a triangulation. In both cases each vertex has an imprecise elevation, given by an interval of possible values, while its (x, y)-coordinates are fixed. For the first model, we show that the problem of deciding whether one vertex may be contained in the watershed of another is NP-hard. In contrast, for the second model we give a simple O(n log n) time algorithm to compute the minimal and the maximal watershed of a vertex, where n is the number of edges of the graph. On a grid model, we can compute the same in O(n) time.

• Flow computations on imprecise terrains

Driemel, Anne; Haverkort, Herman; Loffler, Maarten; Silveira, Rodrigo Ignacio
European Workshop on Computational Geometry
Presentation's date: 2011-03-28
Presentation of work at congresses

• Smoothing imprecise 1.5D terrains

Gray, Chris; Löffler, Maarten; Silveira, Rodrigo Ignacio
International journal of computational geometry and applications
Date of publication: 2010-08
Journal article

• Flooding countries and destroying dams

Silveira, Rodrigo Ignacio; Van Oostrum, René
International journal of computational geometry and applications
Date of publication: 2010-06
Journal article

• Finding the most relevant fragments in networks

Buchin, Kevin; Cabello, Sergio; Gudmundsson, Joachim; Löffler, Maarten; Luo, Jun; Rote, Günter; Silveira, Rodrigo Ignacio; Speckmann, Bettina; Wolle, Thomas
Journal of graph algorithms and applications
Date of publication: 2010-06
Journal article

• Optimization for first order Delaunay triangulations

Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio
Computational geometry: theory and applications
Date of publication: 2010-05
Journal article

• Median trajectories

Buchin, Kevin; Buchin, M.; Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio; Wenk, Carola; Wiratma, Lionov
European Symposium on Algorithms
Presentation's date: 2010-09-06
Presentation of work at congresses

• Removing local extrema from imprecise terrains

Gray, Chris; Kammer, Frank; Löffler, Maarten; Silveira, Rodrigo Ignacio
European Workshop on Computational Geometry
Presentation's date: 2010-03-24
Presentation of work at congresses

• Computing similarity between piecewise-linear functions

Agarwal, Pankaj; Aronov, Boris; Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio
ACM Annual Symposium on Computational Geometry
Presentation's date: 2010-06-16
Presentation of work at congresses

We study the problem of computing the similarity between two piecewise-linear bivariate functions de ned over a common domain, where the surfaces they de ne in 3D|polyhedral terrains|can be transformed vertically by a linear transformation of the third coordinate (scaling and translation). We present a randomized algorithm that minimizes the maximum vertical distance between the graphs of the two functions, over all linear transformations of one of the terrains, in O(n4=3 polylog n) expected time, where n is the total number of vertices in the graphs of the two functions. We also study the computation of similarity between two univariate or bivariate functions by minimizing the area or volume between their graphs. For univariate functions we give a (1+")-approximation algorithm for minimizing the area that runs in O(n=p") time, for any xed " > 0. The (1 + ")- approximation algorithm for the bivariate version, where volume is minimized, runs in O(n="2) time, for any xed " > 0, provided the two functions are de ned over the same triangulation of their domain.

Postprint (author’s final draft)

• On the number of higher order Delaunay triangulations

Mitsche, Dieter Wilhelm; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio
International Conference on Algorithms and Complexity
Presentation's date: 2010-05-27
Presentation of work at congresses

Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-k Delaunay if the circumcircle of each triangle of the triangulation contains at most k points. In this paper we study lower and upper bounds on the number of higher order Delaunay triangulations, as well as their expected number for randomly distributed points. We show that arbitrarily large point sets can have a single higher order Delaunay triangulation, even for large orders, whereas for first order Delaunay triangulations, the maximum number is 2n−3. Next we show that uniformly distributed points have an expected number of at least 2ρ1n(1+o(1)) first order Delaunay triangulations, where ρ1 is an analytically defined constant (ρ1 ≈ 0.525785), and for k > 1, the expected number of order-k Delaunay triangulations (which are not order-i for any i < k) is at least 2ρkn(1+o(1)), where ρk can be calculated numerically.

• Planar bichromatic minimum spanning trees

Borgelt, Magdalene; Kreveld, Marc van; Löffler, Maarten; Luo, Jun; Merrick, Damian; Silveira, Rodrigo Ignacio; Vahedi, Mostafa
Journal of discrete algorithms
Date of publication: 2009
Journal article

• Optimal higher order Delaunay triangulations of polygons

Silveira, Rodrigo Ignacio; Kreveld, Marc van
Computational geometry: theory and applications
Date of publication: 2009
Journal article

• Towards a definition of higher order constrained Delaunay triangulations

Silveira, Rodrigo Ignacio; Kreveld, Marc van
Computational geometry: theory and applications
Date of publication: 2009
Journal article

• Best Paper Award

Silveira, Rodrigo Ignacio; Buchin, Kevin; Cabello, Sergio; Gudmundsson, Joachim; Loffler, Maarten; Luo, Jun; Rote, Günter; Speckmann, Bettina; Wolle, Thomas
Award or recognition

• Optimization of polyhedral terrains

Silveira, Rodrigo Ignacio
Defense's date: 2009-07-08
Utrecht University
Theses

• Matching terrains under a linear transformation

Agarwal, Pankaj; Aronov, Boris; Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio
European Workshop on Computational Geometry
Presentation's date: 2009
Presentation of work at congresses

• Embedding rivers in polyhedral terrains

Kreveld, Marc van; Silveira, Rodrigo Ignacio
ACM Annual Symposium on Computational Geometry
Presentation of work at congresses

• Detecting hotspots in geographic networks

Buchin, Kevin; Cabello, Sergio; Gudmundsson, Joachim; Löffler, Maarten; Luo, Jun; Rote, Günter; Silveira, Rodrigo Ignacio; Speckmann, Bettina; Wolle, Thomas
AGILE International Conference on Geographic Information Science
Presentation of work at congresses

• Minimizing slope change in imprecise 1.5D terrains

Gray, Chris; Löffler, Maarten; Silveira, Rodrigo Ignacio
Presentation's date: 2009
Presentation of work at congresses

• Smoothing imprecise 1.5D terrains

Gray, Chris; Löffler, Maarten; Silveira, Rodrigo Ignacio
Workshop on Approximation and Online Algorithms
Presentation's date: 2009
Presentation of work at congresses

• Connect the dot: computing feed-links with minimum dilation

Aronov, Boris; Buchin, Kevin; Buchin, Maike; Kreveld, Marc van; Löffler, Maarten; Luo, Jun; Silveira, Rodrigo Ignacio; Speckmann, Bettina
Workshop on Algorithms and Data Structures
Presentation's date: 2009-08-22
Presentation of work at congresses

• Clusters in aggregated health data

Buchin, Kevin; Buchin, M.; Kreveld, Marc van; Löffler, Maarten; Luo, Jun; Silveira, Rodrigo Ignacio
International Symposium on Spatial Data Handling
Presentation's date: 2008
Presentation of work at congresses

• Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability

Buchin, Kevin; Buchin, M.; Byrka, Jaroslaw; Nöllenburg, Martin; Okamoto, Yoshio; Silveira, Rodrigo Ignacio; Wolff, Alexander
Symposium on Graph Drawing
Presentation's date: 2008
Presentation of work at congresses

Aronov, Boris; Buchin, Kevin; Buchin, Maike; Jansen, Bart; De Jong, Tom; Kreveld, Marc van; Löffler, Maarten; Luo, Jun; Silveira, Rodrigo Ignacio; Speckmann, Bettina
ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Presentation's date: 2008
Presentation of work at congresses

• Smoothing imprecise 1-dimensional terrains

Gray, Chris; Löffler, Maarten; Silveira, Rodrigo Ignacio
European Workshop on Computational Geometry
Presentation's date: 2008
Presentation of work at congresses

• Optimal higher order delaunay triangulations of polygons

Silveira, Rodrigo Ignacio; Kreveld, Marc van
Latin American Theoretical Informatics Symposium
Presentation's date: 2008
Presentation of work at congresses

• Towards a definition of higher order constrained delaunay triangulations

Silveira, Rodrigo Ignacio; Kreveld, Marc van
Presentation's date: 2007
Presentation of work at congresses

• Optimal higher-order delaunay triangulations of polygons

Silveira, Rodrigo Ignacio; Kreveld, Marc van
European Workshop on Computational Geometry
Presentation's date: 2007
Presentation of work at congresses

• Flooding countries and destroying dams

Silveira, Rodrigo Ignacio; Van Oostrum, René
Workshop on Algorithms and Data Structures
Presentation's date: 2007
Presentation of work at congresses