2009 |
47 | EE | David Eppstein,
Elena Mumford,
Bettina Speckmann,
Kevin Verbeek:
Area-Universal Rectangular Layouts
CoRR abs/0901.3924: (2009) |
2008 |
46 | | Greg Aloupis,
Prosenjit Bose,
Vida Dujmovic,
Chris Gray,
Stefan Langerman,
Bettina Speckmann:
Triangulating and Guarding Realistic Polygons.
CCCG 2008 |
45 | EE | Boris Aronov,
Kevin Buchin,
Maike Buchin,
B. Jansen,
T. de Jong,
Marc J. van Kreveld,
Maarten Löffler,
Jin Luo,
Rodrigo I. Silveira,
Bettina Speckmann:
Feed-links for network extensions.
GIS 2008: 35 |
44 | EE | Michael Kaufmann,
Marc J. van Kreveld,
Bettina Speckmann:
Subdivision Drawings of Hypergraphs.
Graph Drawing 2008: 396-407 |
43 | EE | Noga Alon,
Robert Berke,
Kevin Buchin,
Maike Buchin,
Péter Csorba,
Saswata Shannigrahi,
Bettina Speckmann,
Philipp Zumstein:
Polychromatic colorings of plane graphs.
Symposium on Computational Geometry 2008: 338-345 |
42 | EE | Bettina Speckmann:
Kinetic Data Structures.
Encyclopedia of Algorithms 2008 |
41 | EE | Marc J. van Kreveld,
Joseph S. B. Mitchell,
Peter Rousseeuw,
Micha Sharir,
Jack Snoeyink,
Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth.
Discrete & Computational Geometry 39(4): 656-677 (2008) |
40 | EE | Oswin Aichholzer,
David Orden,
Francisco Santos,
Bettina Speckmann:
On the number of pseudo-triangulations of certain point sets.
J. Comb. Theory, Ser. A 115(2): 254-278 (2008) |
2007 |
39 | | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Bettina Speckmann:
On (Pointed) Minimum Weight Pseudo-Triangulations.
CCCG 2007: 209-212 |
38 | | Marc J. van Kreveld,
Bettina Speckmann:
On the Number of Empty Pseudo-Triangles in Point Sets.
CCCG 2007: 37-40 |
37 | EE | Emilio Di Giacomo,
Walter Didimo,
Marc J. van Kreveld,
Giuseppe Liotta,
Bettina Speckmann:
Matched Drawings of Planar Graphs.
Graph Drawing 2007: 183-194 |
36 | EE | Mohammad Ali Abam,
Mark de Berg,
Bettina Speckmann:
Kinetic KD-trees and longest-side KD-trees.
Symposium on Computational Geometry 2007: 364-372 |
35 | EE | Oswin Aichholzer,
Thomas Hackl,
Michael Hoffmann,
Clemens Huemer,
Attila Pór,
Francisco Santos,
Bettina Speckmann,
Birgit Vogtenhuber:
Maximizing Maximal Angles for Plane Straight-Line Graphs.
WADS 2007: 458-469 |
34 | EE | David Eppstein,
Marc J. van Kreveld,
Elena Mumford,
Bettina Speckmann:
Edges and Switches, Tunnels and Bridges.
WADS 2007: 77-88 |
33 | EE | David Eppstein,
Marc J. van Kreveld,
Elena Mumford,
Bettina Speckmann:
Edges and Switches, Tunnels and Bridges
CoRR abs/0705.0413: (2007) |
32 | EE | Oswin Aichholzer,
Thomas Hackl,
Michael Hoffmann,
Clemens Huemer,
Attila Pór,
Francisco Santos,
Bettina Speckmann,
Birgit Vogtenhuber:
Maximizing Maximal Angles for Plane Straight-Line Graphs
CoRR abs/0705.3820: (2007) |
31 | EE | Mark de Berg,
Joachim Gudmundsson,
René van Oostrum,
Bettina Speckmann:
Editorial.
Comput. Geom. 36(1): 1 (2007) |
30 | EE | Marc J. van Kreveld,
Bettina Speckmann:
On rectangular cartograms.
Comput. Geom. 37(3): 175-187 (2007) |
29 | EE | Joachim Gudmundsson,
Marc J. van Kreveld,
Bettina Speckmann:
Efficient Detection of Patterns in 2D Trajectories of Moving Points.
GeoInformatica 11(2): 195-215 (2007) |
2006 |
28 | EE | Mohammad Ali Abam,
Mark de Berg,
Sheung-Hung Poon,
Bettina Speckmann:
Kinetic Collision Detection for Convex Fat Objects.
ESA 2006: 4-15 |
27 | EE | Sergio Cabello,
Herman J. Haverkort,
Marc J. van Kreveld,
Bettina Speckmann:
Algorithmic Aspects of Proportional Symbol Maps.
ESA 2006: 720-731 |
26 | EE | Mark de Berg,
Elena Mumford,
Bettina Speckmann:
Optimal BSPs and rectilinear cartograms.
GIS 2006: 19-26 |
25 | EE | Oswin Aichholzer,
Clemens Huemer,
S. Kappes,
Bettina Speckmann,
Csaba D. Tóth:
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles.
MFCS 2006: 86-97 |
24 | EE | Prosenjit Bose,
Sergio Cabello,
Otfried Cheong,
Joachim Gudmundsson,
Marc J. van Kreveld,
Bettina Speckmann:
Area-preserving approximations of polygonal paths.
J. Discrete Algorithms 4(4): 554-566 (2006) |
2005 |
23 | EE | Mark de Berg,
Elena Mumford,
Bettina Speckmann:
On Rectilinear Duals for Vertex-Weighted Plane Graphs.
Graph Drawing 2005: 61-72 |
22 | EE | Sander Florisson,
Marc J. van Kreveld,
Bettina Speckmann:
Rectangular cartograms: construction & animation.
Symposium on Computational Geometry 2005: 372-373 |
21 | EE | Bettina Speckmann,
Csaba D. Tóth:
Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations.
Discrete & Computational Geometry 33(2): 345-364 (2005) |
2004 |
20 | EE | Marc J. van Kreveld,
Bettina Speckmann:
On Rectangular Cartograms.
ESA 2004: 724-735 |
19 | EE | Joachim Gudmundsson,
Marc J. van Kreveld,
Bettina Speckmann:
Efficient detection of motion patterns in spatio-temporal data sets.
GIS 2004: 250-257 |
18 | EE | Michael Hoffmann,
Bettina Speckmann,
Csaba D. Tóth:
Pointed Binary Encompassing Trees.
SWAT 2004: 442-454 |
17 | EE | 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 |
16 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Bettina Speckmann:
Convexity minimizes pseudo-triangulations.
Comput. Geom. 28(1): 3-10 (2004) |
2003 |
15 | | Oswin Aichholzer,
David Orden,
Francisco Santos,
Bettina Speckmann:
On the Number of Pseudo-Triangulations of Certain Point Sets.
CCCG 2003: 141-144 |
14 | | Oswin Aichholzer,
Michael Hoffmann,
Bettina Speckmann,
Csaba D. Tóth:
Degree Bounds for Constrained Pseudo-Triangulations.
CCCG 2003: 155-158 |
13 | EE | Bettina Speckmann,
Csaba D. Tóth:
Allocating vertex pi-guards in simple polygons via pseudo-triangulations.
SODA 2003: 109-118 |
12 | EE | Oswin Aichholzer,
Günter Rote,
Bettina Speckmann,
Ileana Streinu:
The Zigzag Path of a Pseudo-Triangulation.
WADS 2003: 377-388 |
11 | | 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) |
2002 |
10 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Bettina Speckmann:
Convexity minimizes pseudo-triangulations.
CCCG 2002: 158-161 |
9 | EE | Marc J. van Kreveld,
Bettina Speckmann:
Cutting a Country for Smallest Square Fit.
ISAAC 2002: 91-102 |
8 | EE | David G. Kirkpatrick,
Bettina Speckmann:
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons.
Symposium on Computational Geometry 2002: 179-188 |
7 | | David G. Kirkpatrick,
Jack Snoeyink,
Bettina Speckmann:
Kinetic Collision Detection for Simple Polygons.
Int. J. Comput. Geometry Appl. 12(1-2): 3-27 (2002) |
2001 |
6 | EE | Lutz Kettner,
David G. Kirkpatrick,
Bettina Speckmann:
Tight degree bounds for pseudo-triangulations of points.
CCCG 2001: 117-120 |
5 | EE | Bettina Speckmann,
Jack Snoeyink:
Easy triangle strips for TIN terrain models.
International Journal of Geographical Information Science 15(4): 379-386 (2001) |
2000 |
4 | EE | David G. Kirkpatrick,
Bettina Speckmann:
Separation Sensitive Kinetic Separation Structures for Convex Polygons.
JCDCG 2000: 222-236 |
3 | EE | David G. Kirkpatrick,
Jack Snoeyink,
Bettina Speckmann:
Kinetic collision detection for simple polygons.
Symposium on Computational Geometry 2000: 322-330 |
1999 |
2 | EE | 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 |
1997 |
1 | | Bettina Speckmann,
Jack Snoeyink:
Easy triangle strips for tin terrain models.
CCCG 1997 |