| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Bettina Speckmann Bettina Speckmann, Csaba D. Tóth : Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations. Discrete & Computational Geometry 33 (2): 345-364 (2005) Marc J. van Kreveld , Bettina Speckmann: On Rectangular Cartograms. ESA 2004 : 724-735 Joachim Gudmundsson , Marc J. van Kreveld , Bettina Speckmann: Efficient detection of motion patterns in spatio-temporal data sets. GIS 2004 : 250-257 Michael Hoffmann , Bettina Speckmann, Csaba D. Tóth : Pointed Binary Encompassing Trees. SWAT 2004 : 442-454 Udo Adamy , Thomas Erlebach , Dieter Mitsche , Ingo Schurr , Bettina Speckmann, Emo Welzl : Off-line Admission Control for Advance Reservations in Star Networks. WAOA 2004 : 211-224 Oswin Aichholzer , David Orden , Francisco Santos , Bettina Speckmann: On the Number of Pseudo-Triangulations of Certain Point Sets. CCCG 2003 : 141-144 Oswin Aichholzer , Michael Hoffmann , Bettina Speckmann, Csaba D. Tóth : Degree Bounds for Constrained Pseudo-Triangulations. CCCG 2003 : 155-158 Bettina Speckmann, Csaba D. Tóth : Allocating vertex pi-guards in simple polygons via pseudo-triangulations. SODA 2003 : 109-118 Oswin Aichholzer , Günter Rote , Bettina Speckmann, Ileana Streinu : The Zigzag Path of a Pseudo-Triangulation. WADS 2003 : 377-388 Lutz Kettner , David G. Kirkpatrick , Andrea Mantler , Jack Snoeyink , Bettina Speckmann, Fumihiko Takeuchi : Tight degree bounds for pseudo-triangulations of points. Comput. Geom. 25 (1-2): 3-12 (2003) Oswin Aichholzer , Franz Aurenhammer , Hannes Krasser , Bettina Speckmann: Convexity minimizes pseudo-triangulations. CCCG 2002 : 158-161 Marc J. van Kreveld , Bettina Speckmann: Cutting a Country for Smallest Square Fit. ISAAC 2002 : 91-102 David G. Kirkpatrick , Bettina Speckmann: Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. Symposium on Computational Geometry 2002 : 179-188 David G. Kirkpatrick , Jack Snoeyink , Bettina Speckmann: Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geometry Appl. 12 (1-2): 3-27 (2002) Lutz Kettner , David G. Kirkpatrick , Bettina Speckmann: Tight degree bounds for pseudo-triangulations of points. CCCG 2001 : 117-120 David G. Kirkpatrick , Bettina Speckmann: Separation Sensitive Kinetic Separation Structures for Convex Polygons. JCDCG 2000 : 222-236 David G. Kirkpatrick , Jack Snoeyink , Bettina Speckmann: Kinetic collision detection for simple polygons. Symposium on Computational Geometry 2000 : 322-330 Marc J. van Kreveld , Joseph S. B. Mitchell , Peter Rousseeuw , Micha Sharir , Jack Snoeyink , Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Symposium on Computational Geometry 1999 : 31-40 Bettina Speckmann, Jack Snoeyink : Easy triangle strips for tin terrain models. CCCG 1997 1 [ 15 ] 2 [ 9 ] [ 11 ] [ 13 ] [ 14 ] 3 [ 9 ] 4 [ 15 ] 5 [ 17 ] 6 [ 13 ] [ 16 ] 7 [ 5 ] [ 10 ] 8 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 10 ] 9 [ 9 ] 10 [ 2 ] [ 8 ] [ 17 ] [ 18 ] 11 [ 10 ] 12 [ 2 ] 13 [ 15 ] 14 [ 14 ] 15 [ 11 ] 16 [ 2 ] 17 [ 14 ] 18 [ 15 ] 19 [ 2 ] 20 [ 1 ] [ 2 ] [ 3 ] [ 6 ] [ 10 ] 21 [ 11 ] 22 [ 10 ] 23 [ 12 ] [ 13 ] [ 16 ] [ 19 ] 24 [ 15 ]  ©2005 Association for Computing Machinery |
