EuroCG C

54 papers

YearTitle / Authors
2005(Informal) Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005
2005A note on simultaneous embedding of planar graphs.
Emilio Di Giacomo, Giuseppe Liotta
2005A pointed Delaunay pseudo-triangulation of a simple polygon.
Günter Rote, André Schulz
2005A unified algorithm for adaptive spacetime meshing with nonlocal cone constraints.
Shripad Thite
2005Abstract order type extension and new results on the rectilinear crossing number.
Oswin Aichholzer, Hannes Krasser
2005Algebraic study of the Apollonius circle of three ellipses.
Ioannis Z. Emiris, George M. Tzoumas
2005An efficient algorithm for label updating in 2PM model to avoid a moving object.
Farshad Rostamabadi, Mohammad Ghodsi
2005An exclusion region for minimum dilation triangulations.
Christian Knauer, Wolfgang Mulzer
2005Approximate multi-visibility map computation.
Narcís Coll, Marta Fort, Joan Antoni Sellarès
2005Approximation algorithm for the L1-fitting circle problem.
Sariel Har-Peled
2005Approximation algorithms for the Earth mover's distance under transformations using reference points.
Oliver Klein, Remco C. Veltkamp
2005Approximation schemes for the generalized geometric problems with geographic clustering.
Corinne Feremans, Alexander Grigoriev
2005Approximations of 3D generalized Voronoi diagrams.
Imma Boada, Narcís Coll, Narcis Madern, Joan Antoni Sellarès
2005Average case complexity of Voronoi diagrams of n sites from the unit cube.
Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, Christian Sohler
2005Bi-chromatic minimum spanning trees.
Magdalene Grantson, Henk Meijer, David Rappaport
2005Boolean operations on 3D selective Nef complexes: Optimized implementation and experiments.
Peter Hachenberger, Lutz Kettner
2005Bounds on optimally triangulating connected subsets of the minimum weight convex partition.
Magdalene Grantson, Christos Levcopoulos
2005Competitive online searching for a ray in the plane.
Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
2005Computing transportation Voronoi diagrams in optimal time.
Yaron Ostrovsky-Berman
2005Constructing higher-order Voronoi diagrams in parallel.
Henning Meyerhenke
2005Constructing interference-minimal networks.
Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff
2005Constructing the city Voronoi diagram faster.
Robert Görke, Alexander Wolff
2005Covering point sets with two convex objects.
José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura
2005Delineating boundaries for imprecise regions.
Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Alexander Wolff
2005Discrete curvatures and Gauss maps for polyhedral surfaces.
Lyuba Alboul, Gilberto Echeverria, Marcos A. Rodrigues
2005Exact analysis of optimal configurations in radii computations.
René Brandenberg, Thorsten Theobald
2005Finding the best shortcut in a geometric network.
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
2005Homotopic spanners.
Sergio Cabello, Bojan Mohar, Arjana Zitnik
2005Improved lower bound on the geometric dilation of point sets.
Adrian Dumitrescu, Ansgar Grüne, Günter Rote
2005Incremental construction along space-filling curves.
Kevin Buchin
2005Lower bounds for kinetic sorting.
Mohammad Ali Abam, Mark de Berg
2005Matching point sets with respect to the Earth mover's distance.
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2005Matching surfaces with characteristic points.
Darko Dimitrov, Christian Knauer, Klaus Kriegel
2005Maximum line-pair stabbing problem and its variations.
Sebastian Böcker, Veli Mäkinen
2005Minimizing local minima in terrains with higher-order Delaunay triangulations.
Thierry de Kok, Marc J. van Kreveld, Maarten Löffler
2005On computing Fréchet distance of two paths on a convex polyhedron.
Anil Maheshwari, Jiehua Yi
2005On optimizing multi-sequence functionals for competitive analysis.
Tom Kamphans, Elmar Langetepe
2005On properties of higher-order Delaunay graphs with applications.
Manuel Abellanas, Prosenjit Bose, Jesús García-López, Ferran Hurtado, Mariano Nicolás, Pedro A. Ramos
2005On pseudo-convex decompositions, partitions, and coverings.
Oswin Aichholzer, Clemens Huemer, Sarah Renkl, Bettina Speckmann, Csaba D. Tóth
2005On the number of facets of three-dimensional Dirichlet stereohedra III: Cubic group.
Pilar Sabariego, Francisco Santos
2005Pointed binary encompassing trees: Simple and optimal.
Michael Hoffmann, Csaba D. Tóth
2005Pseudo-tetrahedral complexes.
Franz Aurenhammer, Hannes Krasser
2005Quadrangulations and 2-colorations.
Carmen Cortés, Alberto Márquez, Atsuhiro Nakamoto, Jesus Valenzuela
2005Quality triangulations made smaller.
Alper Üngör
2005Region counting graphs.
Jean Cardinal, Sébastien Collette, Stefan Langerman
2005Semi-computability of the Fréchet distance between surfaces.
Helmut Alt, Maike Buchin
2005Spanning trees with few crossings in geometric and topological graphs.
Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
2005Ternary blending operations.
Galina Pasko, Alexander A. Pasko, Tosiyasu L. Kunii
2005The fastest way to view a query point in simple polygons.
Ramtin Khosravi, Mohammad Ghodsi
2005The minimum area spanning tree problem.
Paz Carmi, Matthew J. Katz
2005The relative neighbourhood graph is a part of every 30°-triangulation.
J. Mark Keil, Tzvetalin S. Vassilev
2005The visibility-Voronoi complex and its applications.
Ron Wein, Jur P. van den Berg, Dan Halperin
2005Transforming spanning trees and pseudo-triangulations.
Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser
2005Uncertainty envelopes.
Yaron Ostrovsky-Berman, Leo Joskowicz