|
Search the dblp DataBase
Bettina Speckmann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
Convexity minimizes pseudo-triangulations. [Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:158-161 [Conf]
- Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
Degree Bounds for Constrained Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:155-158 [Conf]
- Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann
On the Number of Pseudo-Triangulations of Certain Point Sets. [Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:141-144 [Conf]
- Lutz Kettner, David G. Kirkpatrick, Bettina Speckmann
Tight degree bounds for pseudo-triangulations of points. [Citation Graph (0, 0)][DBLP] CCCG, 2001, pp:117-120 [Conf]
- Bettina Speckmann, Jack Snoeyink
Easy triangle strips for tin terrain models. [Citation Graph (0, 0)][DBLP] CCCG, 1997, pp:- [Conf]
- Sander Florisson, Marc J. van Kreveld, Bettina Speckmann
Rectangular cartograms: construction & animation. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:372-373 [Conf]
- David G. Kirkpatrick, Bettina Speckmann
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2002, pp:179-188 [Conf]
- David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
Kinetic collision detection for simple polygons. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2000, pp:322-330 [Conf]
- Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
Efficient Algorithms for Maximum Regression Depth. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1999, pp:31-40 [Conf]
- Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
Kinetic KD-trees and longest-side KD-trees. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:364-372 [Conf]
- Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann
Kinetic Collision Detection for Convex Fat Objects. [Citation Graph (0, 0)][DBLP] ESA, 2006, pp:4-15 [Conf]
- Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
Algorithmic Aspects of Proportional Symbol Maps. [Citation Graph (0, 0)][DBLP] ESA, 2006, pp:720-731 [Conf]
- Marc J. van Kreveld, Bettina Speckmann
On Rectangular Cartograms. [Citation Graph (0, 0)][DBLP] ESA, 2004, pp:724-735 [Conf]
- Mark de Berg, Elena Mumford, Bettina Speckmann
On Rectilinear Duals for Vertex-Weighted Plane Graphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:61-72 [Conf]
- Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
Efficient detection of motion patterns in spatio-temporal data sets. [Citation Graph (0, 0)][DBLP] GIS, 2004, pp:250-257 [Conf]
- Mark de Berg, Elena Mumford, Bettina Speckmann
Optimal BSPs and rectilinear cartograms. [Citation Graph (0, 0)][DBLP] GIS, 2006, pp:19-26 [Conf]
- Marc J. van Kreveld, Bettina Speckmann
Cutting a Country for Smallest Square Fit. [Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:91-102 [Conf]
- David G. Kirkpatrick, Bettina Speckmann
Separation Sensitive Kinetic Separation Structures for Convex Polygons. [Citation Graph (0, 0)][DBLP] JCDCG, 2000, pp:222-236 [Conf]
- Oswin Aichholzer, Clemens Huemer, S. Kappes, Bettina Speckmann, Csaba D. Tóth
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. [Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:86-97 [Conf]
- Bettina Speckmann, Csaba D. Tóth
Allocating vertex pi-guards in simple polygons via pseudo-triangulations. [Citation Graph (0, 0)][DBLP] SODA, 2003, pp:109-118 [Conf]
- Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
Pointed Binary Encompassing Trees. [Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:442-454 [Conf]
- Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
The Zigzag Path of a Pseudo-Triangulation. [Citation Graph (0, 0)][DBLP] WADS, 2003, pp:377-388 [Conf]
- Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
Off-line Admission Control for Advance Reservations in Star Networks. [Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:211-224 [Conf]
- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
Convexity minimizes pseudo-triangulations. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:28, n:1, pp:3-10 [Journal]
- Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
Tight degree bounds for pseudo-triangulations of points. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2003, v:25, n:1-2, pp:3-12 [Journal]
- Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann
Editorial. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:36, n:1, pp:1- [Journal]
- Bettina Speckmann, Csaba D. Tóth
Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2005, v:33, n:2, pp:345-364 [Journal]
- Bettina Speckmann, Jack Snoeyink
Easy triangle strips for TIN terrain models. [Citation Graph (0, 0)][DBLP] International Journal of Geographical Information Science, 2001, v:15, n:4, pp:379-386 [Journal]
- David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
Kinetic Collision Detection for Simple Polygons. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:3-27 [Journal]
- Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
Area-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:4, pp:554-566 [Journal]
- Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
On (Pointed) Minimum Weight Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:209-212 [Conf]
- Marc J. van Kreveld, Bettina Speckmann
On the Number of Empty Pseudo-Triangles in Point Sets. [Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:37-40 [Conf]
- David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
Edges and Switches, Tunnels and Bridges. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:77-88 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:458-469 [Conf]
- Marc J. van Kreveld, Bettina Speckmann
On rectangular cartograms. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:37, n:3, pp:175-187 [Journal]
- David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
Edges and Switches, Tunnels and Bridges [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- 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 [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
Efficient Detection of Patterns in 2D Trajectories of Moving Points. [Citation Graph (0, 0)][DBLP] GeoInformatica, 2007, v:11, n:2, pp:195-215 [Journal]
Triangulating and Guarding Realistic Polygons. [Citation Graph (, )][DBLP]
Polychromatic colorings of plane graphs. [Citation Graph (, )][DBLP]
Area-universal rectangular layouts. [Citation Graph (, )][DBLP]
Rectangular cartograms: the game. [Citation Graph (, )][DBLP]
Shooting permanent rays among disjoint polygons in the plane. [Citation Graph (, )][DBLP]
On pseudo-convex decompositions, partitions, and coverings. [Citation Graph (, )][DBLP]
Subdivision Drawings of Hypergraphs. [Citation Graph (, )][DBLP]
Geometric Simultaneous Embeddings of a Graph and a Matching. [Citation Graph (, )][DBLP]
Matched Drawings of Planar Graphs. [Citation Graph (, )][DBLP]
On Planar Supports for Hypergraphs. [Citation Graph (, )][DBLP]
Feed-links for network extensions. [Citation Graph (, )][DBLP]
Area-Preserving Subdivision Schematization. [Citation Graph (, )][DBLP]
Homotopic Rectilinear Routing with Few Links and Thick Edges. [Citation Graph (, )][DBLP]
Connect the Dot: Computing Feed-Links with Minimum Dilation. [Citation Graph (, )][DBLP]
Plane Graphs with Parity Constraints. [Citation Graph (, )][DBLP]
Detecting Hotspots in Geographic Networks. [Citation Graph (, )][DBLP]
Kinetic Collision Detection for Convex Fat Objects. [Citation Graph (, )][DBLP]
Edges and switches, tunnels and bridges. [Citation Graph (, )][DBLP]
On minimum weight pseudo-triangulations. [Citation Graph (, )][DBLP]
Pointed binary encompassing trees: Simple and optimal. [Citation Graph (, )][DBLP]
Area-Universal Rectangular Layouts [Citation Graph (, )][DBLP]
Efficient Algorithms for Maximum Regression Depth. [Citation Graph (, )][DBLP]
Polychromatic Colorings of Plane Graphs. [Citation Graph (, )][DBLP]
On rectilinear duals for vertex-weighted plane graphs. [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.009secs
|