16. EWCG 2000:
Eilat,
Israel
(Informal) Proceedings of the 16th European Workshop on Computational Geometry:
Eilat,
Israel,
March 13-15,
2000,
Sponsored by The European Commission and Ben-Gurion University of the Negev
- Ron Kimmel, James A. Sethian:
Fast Voronoi Diagrams on Triangulated Surfaces.
1-4
- Cao An Wang, Boting Yang:
Optimal Tetrahedralizations of Some Convex Polyhedra.
5-9
- Francois Anton, Darka Mioc:
Dynamic Laguerre Diagrams Made Easy.
10-13
- Udo Adamy, Joachim Giesen, Matthias John:
The Lambda-Complex and Surface Reconstruction.
14-17
- Martin Isenburg:
Triangle Fixer: Edge-based Connectivity Compression.
18-23
- Boris Kronrod, Craig Gotsman:
Efficient Coding of Non-Triangular Meshes.
24-26
- Zachi Karni, Craig Gotsman:
Spectral Compression of Mesh Geometry.
27-30
- Vitaly Surazhsky, Craig Gotsman:
Morphing Planar Triangulations and Polygons using Convex Representations.
31-34
- Gill Barequet, Gershon Elber:
alpha-Sector of Rational Varieties.
35-39
- Tatiana Surazhsky, Vitaly Surazhsky, Gill Barequet, Ayellet Tal:
Smooth Blending of Polygonal Slices with Different Topologies.
40-44
- Ilya Eckstein, Vitaly Surazhsky, Craig Gotsman:
Compatible Geometries by Convex Representations with Applications to Computer Graphics.
45-46
- Roser Guardia, Ferran Hurtado:
On the Equipartitions of Convex Bodies and Convex Polygons.
47-50
- Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena:
Some Separability Problems in the Plane.
51-54
- Matthew J. Katz, Frank Nielsen, Michael Segal:
Shooter Location through Piercing Sets.
55-58
- Peter Brass:
On the Approximation of Polygons by Subpolygons.
59-61
- Robert Connelly, Erik D. Demaine, Günter Rote:
Every Polygon Can Be Untangled.
62-65
- Vladimir Oliker:
Electromagnetic Scattering, 1D/2D Obstacle Problem, and Discrete Geodesics.
66-69
- Frantisek Brabec, Hanan Samet:
Visualizing and Animating Search Operations on Quadtrees on the Worldwide Web.
70-76
- Lutz Kettner:
Contour-Edge Based Polyhedron Visualization.
77-80
- Sigal Ar, Ayellet Tal:
Query Driven BSP Trees.
81-84
- Eyal Flato, Dan Halperin:
Robust and Efficient Construction of Planar Minkowski Sums.
85-88
- Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz:
Covering Simple Polygonal Regions by Ellipses.
89-92
- Jerzy W. Jaromczyk, Miroslaw Kowaluk:
The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets.
93-97
- Adee Ran, Nir A. Sochen:
Differential Geometry Techniques in Stereo Vision.
98-103
- Peter Braß, Christian Knauer:
Testing the Congruence of d-Dimensional Point Sets.
104-107
- Pierre Angelier, Michel Pocchiola:
On Computing Tangent Visibility Graphs.
108-111
- Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp:
A Robust Affine Invariant Similarity Measure Based on Visibility.
112-116
- Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud:
Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs.
117-120
- Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado:
Edge Operations on Non-Crossing Spanning Trees.
121-125
- Martin Dlouhý, Frantisek Brabec, Petr Svestka:
Cleaning Path Planning for Mobile Robots.
126-131
- Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions.
132-135
- Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen:
Orienting Polyhedral Parts by Pushing.
136-139
- Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
Exploring an Unknown Cellular Environment.
140-143
Copyright © Sat Nov 28 22:13:20 2009
by Michael Ley (ley@uni-trier.de)
