Publications

Bibtex file ecg_publis.bib

ABL03

Dominique Attali, Jean-Daniel Boissonnat, and André Lieutier.
Complexity of the delaunay triangulation of points on surfaces: The smooth case.
In Proc. 19th Annu. ACM Sympos. Comput. Geom., pages 237-246, 2003.

ACSD+03

Pierre Alliez, David Cohen-Steiner, Olivier Devillers, Bruno Levy, and Mathieu Desbrun.
Anisotropic polygonal remeshing.
ACM Transactions on Graphics, 2003.
SIGGRAPH '2003 Conference Proceedings.

AdVDI03

Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, and Martin Isenburg.
Isotropic surface remeshing.
In International Conference on Shape Modeling and applications, pages 49-58, 2003.

AMD02

Pierre Alliez, Mark Meyer, and Mathieu Desbrun.
Interactive geometry remeshing.
ACM Transactions on Graphics, 21:347-354, 2002.
SIGGRAPH '2002 Conference Proceedings.

AP01

P. Angelier and M. Pocchiola.
A sum of squares theorem for visibility complexes.
In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 302-311, 2001.

AS04

Helmut Alt and Ludmila Scharf.
Computing the Hausdorff distance between curved objects.
In Abstracts of the 20th European Symposium on Computational Geometry, pages 233-236, Seville, March 2004.

BA02

Jean-Daniel Boissonnat and Dominique Attali.
A linear bound on the complexity of the Delaunay triangulation of points on a surface.
In Proc. 7th ACM Symp. on Solid Modeling and Applications, pages 139-146, Saarbrücken, June 2002.

BCM03

V. Borrelli, F. Cazals, and J-M. Morvan.
On the angular defect of triangulations and the pointwise approximation of curvatures.
Comput. Aided Geom. Design, 20, 2003.

BEH+02

Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, and Elmar Schömer.
A computational basis for conic arcs and boolean operations on conic polygons.
In Rolf Möhring and Rajeev Raman, editors, Algorithms - ESA 2002, volume 2461 of Lecture Notes in Computer Science, pages 174-186, Rome, Italy, September 2002. Springer.

BF02

Jean-Daniel Boissonnat and Julia Flötotto.
A local coordinate system on a surface.
In Proc. 7th ACM Symp. on Solid Modeling and Applications, pages 116-126, Saarbrücken, June 2002.

BF04

Jean-Daniel Boissonnat and Julia Flötotto.
A coordinate system associated with points scattered on a surface.
Computer-Aided Design, 36:161-174, 2004.

BFM+01

Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, and Susanne Schmitt.
A separation bound for real algebraic expressions.
In Friedhelm Meyer auf der Heide, editor, Algorithms - ESA 2001 (ESA-01) : Proceedings of the 9th Annual European Symposium,, volume 2161 of Lecture Notes in Computer Science, pages 254-265, Aarhus, Denmark, August 2001. Springer.

BG03

Laurent Busé and André Galligo.
A resultant approach to detect intersecting curves in .
In MEGA electronic proceedings, 2003.

BK03

Jean-Daniel Boissonnat and Menelaos Karavelas.
On the combinatorial complexity of Euclidean Voronoi cells and convex hulls of d-dimensional spheres.
In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 305-312, 2003.

BO03

J. D. Boissonnat and S. Oudot.
Provably good surface sampling and approximation.
In Proc. 1st Symp. on Geometry Processing, pages 9-18, 2003.

BO04

J.-D. Boissonnat and S. Oudot.
An effective condition for sampling surfaces with guarantees.
In Proc. 9th Annu. ACM Sympos. on Solid Modeling and Applications, 2004.

BTEFH04

N. Ben-Tal, A. Enosh, S.J. Fleishman, and D. Halperin.
Assigning transmembrane segments to helics in intermediate-resolution structures.
In Proc. ISMB /ECCB 2004, 2004.
To appear.

CCL03

Frédéric Cazals, Frédéric Chazal, and Thomas Lewiner.
Molecular shape analysis based upon the morse-smale complex and the connolly function.
In Proc. 19th Annu. ACM Sympos. Comput. Geom., pages 237-246, 2003.

CdVPV01

Éric Colin de Verdière, Michel Pocchiola, and Gert Vegter.
Tutte's barycenter method applied to isotopies.
In Abstracts for the Thirteenth Canadian Conference on Computational Geometry, pages 57-60, August 2001.
Long version available in the electronic proceedings at http://compgeo.math.uwaterloo.ca/~cccg01/proceedings/long/colin-41348.ps.gz.

Cha03

Raphaëlle Chaine.
A geometric convection approach of 3-d reconstruction.
In Proc. 1st Symp. on Geometry Processing, pages 218-229, 2003.

CLHP

I. Hanniel C. Linhart, D. Halperin and S. Har-Peled.
An experimental study of on-line methods for zone construction in arrangements of lines in the plane.
Internat. J. Comput. Geom. Appl.
In press.

CLLR04

Yi-Jen Chiang, Tobias Lenz, Xiang Lu, and Günter Rote.
Simple and output-sensitive construction of contour trees using monotone paths.
Computational Geometry, Theory and Applications, 2004.
to appear.

CP03

F. Cazals and M. Pouget.
Estimating differential quantities using polynomial fitting of osculating jets.
In Proc. 1st Symp. on Geometry Processing, pages 177-187, 2003.

CSM03

David Cohen-Steiner and Jean-Marie Morvan.
Restricted delaunay triangulations and normal cycle.
In Proc. 19th Annu. ACM Sympos. Comput. Geom., pages 237-246, 2003.

DE03

C. D'Andrea and I.Z. Emiris.
Sparse resultant perturbations.
In M. Joswig and N. Takayama, editors, Algebra, Geometry, and Software Systems, Mathematics and Visualization, pages 93-107. Springer-Verlag, Berlin, 2003.

DFMT02

Oliviers Devillers, Alexandra Fronville, Bernard Mourrain, and Monique Teillaud.
Algebraic methods and arithmetic filtering for exact predicates on circle arcs.
Computational Geometry: Theory and Applications, 22:119-142, 2002.

DGG03

T.K. Dey, J. Giesen, and S. Goswami.
Shape segmentation and matching with flow discretization.
In Proceedings of 8th International Workshop on Algorithms and Data Structures (WADS), pages 25-36. Springer Lecture Notes in Computer in Computer Science, 2003.

DGJ03

Tamal K. Dey, Joachim Giesen, and Matthias John.
Alpha-shapes and flow shapes are homotopy equivalent.
In Proceedings of the thirty-fifth ACM symposium on Theory of computing, pages 493-502. ACM Press, 2003.

DP02

Olivier Devillers and Sylvain Pion.
Efficient exact geometric predicates for Delaunay triangulations.
Rapport de recherche 4351, INRIA, 2002.

DRMRT02

G. Dos Reis, B. Mourrain, R. Rouillier, and Ph. Trébuchet.
An environment for symbolic and numeric computation.
World Scientific, pages 239-249, 2002.

dVL02

Eric Colin de Verdière and Francis Lazarus.
Optimal system of loops on an orientable surface.
In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FoCS'02), pages 305-312, 2002.

EHIW04a

G. Elber, D. Halperin, O. Ilushin, and R. Wein.
Continuous path verification in multi-axis nc-machining.
In Proc. 20th ACM Symposium on Computational Geometry, SoCG 2004, 2004.
To appear.

EHIW04b

G. Elber, D. Halperin, O. Ilushin, and R. Wein.
Precise global collision detection in multi-axis nc-machining.
In Proc. International CAD Conference, 2004.
To appear.

EHS

E. Ezra, D. Halperin, and M. Sharir.
Speeding up the incremental construction of the union of geometric objects in practice.
Comput. Geom. Theory Appl.
Special issue, papers from The European Workshop on Computational Geometry 2002. In press.

EHS02

E. Ezra, D. Halperin, and M. Sharir.
Speeding up the incremental construction of the union of geometric objects in practice.
In Proc. 10th European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 473-484. Springer-Verlag, 2002.

EHS04

E. Ezra, D. Halperin, and M. Sharir.
Speeding up the incremental construction of the union of geometric objects in practice.
Computational Geometry: Theory and Applications, 27:63-85, 2004.
Special issue, papers from the 18th European Workshop on Computational Geometry, Warsaw, April 2002.

EKP+04

Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, and Elias P. Tsigaridas.
Towards an open curved kernel.
In Proc. 20th Annu. ACM Sympos. Comput. Geom., 2004.

EKSW04

Arno Eigenwillig, Lutz Kettner, Elmar Schömer, and Nicola Wolpert.
Complete, exact, and efficient computations with cubic curves.
In Proc. 20th Annu. ACM Sympos. Comput. Geom., 2004.
to appear.

Emi02

I.Z. Emiris.
Toric elimination theory.
In Proc. Encuentro de Algebra Computacional y Aplicaciones (EACA) (Invited talk), pages 49-64, Spain, September 2002.

Emi03

I.Z. Emiris.
Discrete geometry for algebraic elimination.
In M. Joswig and N. Takayama, editors, Algebra, Geometry, and Software Systems, Mathematics and Visualization, pages 77-91. Springer-Verlag, Berlin, 2003.

EP02

I.Z. Emiris and V.Y. Pan.
Symbolic and numeric methods for exploiting structure in constructing resultant matrices.
Journal of Symbolic Computation, 33:393-413, 2002.

EP03

I.Z. Emiris and V.Y. Pan.
Improved computation of determinants and resultants.
In Proc. Internat. Workshop Computer Algebra in Scientific Computing (CASC), pages 81-94, Passau, Germany, September 2003.

FFHL02

E. Flato, E. Fogel, D. Halperin, and E. Leiserowitz.
Video: Exact minkowski sums and applications.
In Proc. 18th ACM Symposium on Computational Geometry, pages 273-274, 2002.

FG03

Kaspar Fischer and Bernd Gärtner.
The smallest enclosing ball of balls: combinatorial structure and algorithms.
In Proceedings of the nineteenth conference on Computational geometry, pages 292-301. ACM Press, 2003.

FGK03

Kaspar Fischer, Bernd Gärtner, and Martin Kutz.
Fast smallest-enclosing-ball computation in high dimensions.
In Proc. 11th Annu. European Sympos. Algorithms, volume 2832 of Lecture Notes Comput. Sci., pages 630-641. Springer-Verlag, 2003.

GHH+03

Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, and Michael Seel.
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, and implementation.
In Proc. 11th Annu. European Sympos. Algorithms (ESA'03), LNCS 2832, pages 654-666, Budapest, Hungary, September 2003. Springer-Verlag.

GHS01

N. Geismann, M. Hemmer, and E. Schömer.
Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and actually!
In Annual ACM Symposium on Computational Geometry, pages 264-273, 2001.

GJ

Joachim Giesen and Matthias John.
Duality in disk induced flows.
In Proc. 2nd Intern. Workshop on Computational Geometry and Applications (CGA).
to appear.

GJ02a

Joachim Giesen and Matthias John.
The complexity of flow diagrams in the plane.
In Proc. 14th Canadian Conference on Computational Geometry, pages 45-48, 2002.

GJ02b

Joachim Giesen and Matthias John.
New diagrams from disks in the plane.
In Proc. 19th International Symp. on Theoretical Aspects of Computer Science (STACS), pages 238-249, 2002.

GJ02c

Joachim Giesen and Matthias John.
Surface reconstruction based on a dynamical system.
In Proceedings of Annual Conference of the European Association for Computer Graphics, 2002.
to appear.

GJ03a

Joachim Giesen and Matthias John.
Computing the weighted flow complex.
In Proceedings of the 8th International Fall Workshop Vision, Modeling, and Visualization, pages 235-243. IOS Press, 2003.

GJ03b

Joachim Giesen and Matthias John.
The flow complex: a data structure for geometric modeling.
In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 285-294. Society for Industrial and Applied Mathematics, 2003.

Hal02

D. Halperin.
Robust geometric computing in motion.
International Journal of Robotics Research, 21(3):219-232, 2002.

HH02

S. Hirsch and D. Halperin.
Hybrid motion planning: Coordinating two discs moving among polygonal obstacles in the plane.
In Proc. 5th Workshop on Algorithmic Foundations of Robotics (WAFR), pages 225-241, Nice, 2002.

HHHPL03

D. Halperin, I. Hanniel, S. Har-Peled, and C. Linhart.
On-line zone construction in arrangements of lines in the plane.
International Journal of Computational Geometry and Applications, 13(6):463-485, 2003.

HL

D. Halperin and E. Leiserowitz.
Controlled perturbation for arrangements of circles.
Internat. J. Comput. Geom. Appl.
Special issue, papers from SOCG 2003. Accepted for publication.

HL03

D. Halperin and E. Leiserowitz.
Controlled perturbation for arrangements of circles.
In Proc. 19th ACM Symposium on Computational Geometry, SoCG 2003, pages 264-273, 2003.
To appear in International Journal of Computational Geometry and Applications, special issue, papers from SoCG 2003.

HP02

Dan Halperin and Eli Packer.
Iterated snap rounding.
Comput. Geom. Theory Appl., 23:209-225, 2002.

JDBV04

David Cohen-Steiner Jean-Daniel Boissonnat and Gert Vegter.
Isotopic implicit surface meshing.
In Proceedings Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC), Chicago, 2004, 2004.
To appear.

JGS03

Matthias John Joachim Giesen and Michel Stoecklin.
Symmetry of flow diagrams derived from weighted points in the plane.
International Journal of Computational Geometry and Applications, 13:327-337, 2003.

KE03

M.I. Karavelas and I.Z. Emiris.
Root comparison techniques applied to the planar additively weighted Voronoi diagram.
In Proc. Symp. on Discrete Algorithms (SODA-03), pages 320-329, January 2003.

KMP+04

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap.
Classroom examples of robustness problems in geometric computations.
In Proc. 12th Annu. European Sympos. Algorithms (ESA'04), September 2004.
to appear.

KV02

Nico Kruithof and Gert Vegter.
Approximation by skin curves.
In Proceedings 18th European Workshop on Computational Geometry, pages 109-111, 2002.

KV03

Nico Kruithof and Gert Vegter.
Approximation by skin surfaces.
In Proceedings 8th ACM Symposium on Solid Modeling and Applications, pages 86-95, 2003.

KV04

Nico Kruithof and Gert Vegter.
Approximation by skin surfaces.
Computer Aided Design, 2004.
Special issue. Papers from Solid Modeling 2003. Accepted for publication.

KY02

Menelaos I. Karavelas and Mariette Yvinec.
Dynamic additively weighted Voronoi diagrams in 2D.
In Proc. 10th Europ. Symp. on Algorithms, pages 586-598, 2002.

KY03

Menelaos Karavelas and Mariette Yvinec.
The voronoi diagram of convex objects in the plane.
In Proc. 11th European Symposium on Algorithms, 2003.

Lan02

Ekaterina Langer.
Implementation of approximation methods for finding intersection points of planar curves.
Master's thesis, Freie Universität Berlin, 2002.

LPVV01

Francis Lazarus, Michel Pocchiola, Gert Vegter, and Anne Verroust.
Computing a canonical polygonal schema of an orientable triangulated surface.
In Proceedings of the seventeenth annual symposium on Computational geometry, pages 80-89. ACM Press, 2001.

LSHL

I. Lotan, F. Schwarzer, D. Halperin, and J.-C. Latombe.
Algorithm and data structures for efficient energy maintenance during monte carlo simulation of proteins.
J. of Computational Biology.
Accepted for publication.

LSHL02

I. Lotan, F. Schwarzer, D. Halperin, and J.-C. Latombe.
Efficient maintenance and self-collision testing for kinematic chains.
In Proc. 18th ACM Symposium on Computational Geometry, pages 43-52, 2002.

Meh01

K. Mehlhorn.
A remark on the sign variation method for real root isolation.
Journal of Symbolic Computation, 2001.
To appear.

MT02

B. Mourrain and Ph. Trébuchet.
Algebraic methods for numerical solving.
In Proc. of the 3rd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing'01 (Timisoara, Romania), pages 42-57, 2002.

MTT04

Bernard Mourrain, Jean-Pierre Técourt, and Monique Teillaud.
Predicates for the sweeping of an arrangement of quadrics in 3d.
Comput. Geom. Theory Appl., 2004.
Special issue, 19th European Workshop on Computational Geometry, March 2003, Bonn, to appear.

MVY02

B. Mourrain, M. Vrahatis, and J.C. Yakoukshon.
Isolating real roots and computing with certainty the topological degree.
to appear J. of Complexity, 2002.

PV03

Simon Plantinga and Gert Vegter.
Contour generators of evolving implicit surfaces.
In Proceedings 8th ACM Symposium on Solid Modeling and Applications, pages 23-32, 2003.

PV04

Simon Plantinga and Gert Vegter.
Isotopic implicit surface meshing.
In Proceedings Symposium on Geometry Processing, Eurographics Proceedings Series, 2004.
To appear.

Rot04

Günter Rote.
Computing the Fréchet distance between piecewise smooth curves.
In Abstracts of the 20th European Symposium on Computational Geometry, pages 147-150, Seville, March 2004.

Rot05

Günter Rote.
Computing the fréchet distance between piecewise smooth curves.
2005.
special issue, invited papers from the 20th European Symposium on Computational Geometry, Seville, submitted for publication.

SH02

H. Shaul and D. Halperin.
Improved construction of vertical decompositions of 3d arrangements.
In Proc. 18th ACM Symposium on Computational Geometry, pages 283-292, 2002.

SW

Elmar Schömer and Nicola Wolpert.
An exact and efficient approach for computing a cell in an arrangement of quadrics.
Accepted for CGTA: Special Issue on Robust Geometric Algorithms and their Implementations.

TKDG03

Joachim Giesen Tamal K. Dey and Samrat Goswami.
Shape segmentation and matching with flow discretization.
In Proceedings of the 8th international workshop on algorithms and data structures, pages 25-36. Springer Verlag, 2003.

Veg02

Gert Vegter.
Evolution of apparent contours.
In Proceedings 18th European Workshop on Computational Geometry (invited talk), pages V-VII, 2002.

Veg04

Gert Vegter.
Computational topology.
In Eli Goodman and Jo O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 32. CRC Press, 2004.

Wei02

Ron Wein.
High level filtering for arrangements of conic arcs.
In Proc. 10th European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 884-895. Springer-Verlag, Rome, 2002.

Wol03

Nicola Wolpert.
Jacobi curves: Computing the exact topology of non-singular algebraic curves.
In ESA 2003, Lecture Notes in Computer Science, pages 532-543, 2003.