The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bettina Speckmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
    Convexity minimizes pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:158-161 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. Bettina Speckmann, Jack Snoeyink
    Easy triangle strips for tin terrain models. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Marc J. van Kreveld, Bettina Speckmann
    On Rectangular Cartograms. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:724-735 [Conf]
  14. 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]
  15. 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]
  16. Mark de Berg, Elena Mumford, Bettina Speckmann
    Optimal BSPs and rectilinear cartograms. [Citation Graph (0, 0)][DBLP]
    GIS, 2006, pp:19-26 [Conf]
  17. Marc J. van Kreveld, Bettina Speckmann
    Cutting a Country for Smallest Square Fit. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:91-102 [Conf]
  18. David G. Kirkpatrick, Bettina Speckmann
    Separation Sensitive Kinetic Separation Structures for Convex Polygons. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:222-236 [Conf]
  19. 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]
  20. 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]
  21. Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
    Pointed Binary Encompassing Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:442-454 [Conf]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]

  39. Triangulating and Guarding Realistic Polygons. [Citation Graph (, )][DBLP]


  40. Polychromatic colorings of plane graphs. [Citation Graph (, )][DBLP]


  41. Area-universal rectangular layouts. [Citation Graph (, )][DBLP]


  42. Rectangular cartograms: the game. [Citation Graph (, )][DBLP]


  43. Shooting permanent rays among disjoint polygons in the plane. [Citation Graph (, )][DBLP]


  44. On pseudo-convex decompositions, partitions, and coverings. [Citation Graph (, )][DBLP]


  45. Subdivision Drawings of Hypergraphs. [Citation Graph (, )][DBLP]


  46. Geometric Simultaneous Embeddings of a Graph and a Matching. [Citation Graph (, )][DBLP]


  47. Matched Drawings of Planar Graphs. [Citation Graph (, )][DBLP]


  48. On Planar Supports for Hypergraphs. [Citation Graph (, )][DBLP]


  49. Feed-links for network extensions. [Citation Graph (, )][DBLP]


  50. Area-Preserving Subdivision Schematization. [Citation Graph (, )][DBLP]


  51. Homotopic Rectilinear Routing with Few Links and Thick Edges. [Citation Graph (, )][DBLP]


  52. Connect the Dot: Computing Feed-Links with Minimum Dilation. [Citation Graph (, )][DBLP]


  53. Plane Graphs with Parity Constraints. [Citation Graph (, )][DBLP]


  54. Detecting Hotspots in Geographic Networks. [Citation Graph (, )][DBLP]


  55. Kinetic Collision Detection for Convex Fat Objects. [Citation Graph (, )][DBLP]


  56. Edges and switches, tunnels and bridges. [Citation Graph (, )][DBLP]


  57. On minimum weight pseudo-triangulations. [Citation Graph (, )][DBLP]


  58. Pointed binary encompassing trees: Simple and optimal. [Citation Graph (, )][DBLP]


  59. Area-Universal Rectangular Layouts [Citation Graph (, )][DBLP]


  60. Efficient Algorithms for Maximum Regression Depth. [Citation Graph (, )][DBLP]


  61. Polychromatic Colorings of Plane Graphs. [Citation Graph (, )][DBLP]


  62. On rectilinear duals for vertex-weighted plane graphs. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002