The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Franz Aurenhammer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Franz Aurenhammer
    Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. [Citation Graph (3, 0)][DBLP]
    ACM Comput. Surv., 1991, v:23, n:3, pp:345-405 [Journal]
  2. Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
    Matching Edges and Faces in Polygonal Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:126-129 [Conf]
  3. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
    Convexity minimizes pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:158-161 [Conf]
  4. Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
    Small weak epsilon nets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:52-56 [Conf]
  5. Franz Aurenhammer
    Using Gale Transforms in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1988, pp:202-216 [Conf]
  6. Franz Aurenhammer, Gerd Stöckl, Emo Welzl
    The Post Office Problem for Fuzzy Point Sets. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1991, pp:1-11 [Conf]
  7. Oswin Aichholzer, Franz Aurenhammer
    Straight Skeletons for General Polygonal Figures in the Plane. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:117-126 [Conf]
  8. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
    Towards Compatible Triangulations. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:101-110 [Conf]
  9. Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
    Approximating Uniform Triangular Meshes in Polygons. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:23-33 [Conf]
  10. Oswin Aichholzer, Franz Aurenhammer, Peter Braay
    Spatial embedding of pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:144-153 [Conf]
  11. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou
    Voronoi Diagrams for Direction-Sensitive Distances. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:418-420 [Conf]
  12. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl
    Pre-triangulations and liftable complexes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:282-291 [Conf]
  13. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Enumerating order types for small sets with applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:11-18 [Conf]
  14. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    On the crossing number of complete graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:19-24 [Conf]
  15. Oswin Aichholzer, Franz Aurenhammer, Belén Palop
    Quickest paths, straight skeletons, and the city Voronoi diagram. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:151-159 [Conf]
  16. Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote
    Triangulations Intersect Nicely. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:220-229 [Conf]
  17. Franz Aurenhammer
    Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:21-29 [Conf]
  18. Franz Aurenhammer, Friedrich Hoffman, Boris Aronov
    Minkowski-Type Theorems and Least-Squares Partitioning. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:350-357 [Conf]
  19. Franz Aurenhammer, Otfried Schwarzkopf
    A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:142-151 [Conf]
  20. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
    Edge Operations on Non-Crossing Spanning Trees. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:121-125 [Conf]
  21. Franz Aurenhammer
    A New Duality Result Concerning Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:21-30 [Conf]
  22. Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
    Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:29-44 [Conf]
  23. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized Self-Approaching Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:317-326 [Conf]
  24. Franz Aurenhammer, Hiroshi Imai
    Geometric Relations Among Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:53-65 [Conf]
  25. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:12-24 [Conf]
  26. Franz Aurenhammer, Johann Hagauer
    Recognizing Binary Hamming Graphs in O(n² log n) Time. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:90-98 [Conf]
  27. Franz Aurenhammer, F. Hoffmann, Boris Aronov
    Minkowski-Type Theorems and Least-Squares Clustering. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:1, pp:61-76 [Journal]
  28. Franz Aurenhammer
    On-Line Sorting of Twisted Sequences in Linear Time. [Citation Graph (0, 0)][DBLP]
    BIT, 1988, v:28, n:2, pp:194-204 [Journal]
  29. Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
    Cartesian Graph Factorization at Logarithmic Cost per Edge. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:331-349 [Journal]
  30. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
    Sequences of spanning trees and a fixed tree theorem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:1-2, pp:3-20 [Journal]
  31. 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]
  32. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    On the Crossing Number of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Computing, 2006, v:76, n:1-2, pp:165-176 [Journal]
  33. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized self-approaching curves. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:3-24 [Journal]
  34. Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner
    Faster Isometric Embedding in Products of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:1, pp:17-28 [Journal]
  35. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
    Connecting colored point sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:3, pp:271-278 [Journal]
  36. Franz Aurenhammer
    A Criterion for the Affine Equivalence of Cell Complexes in Rd and Convex Polyhedra in Rd+1+. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:49-64 [Journal]
  37. Franz Aurenhammer
    A New Duality Result Concerning Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:243-254 [Journal]
  38. Franz Aurenhammer, Hannes Krasser
    Pseudo-Simplicial Complexes from Maximal Locally Convex Functions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:2, pp:201-221 [Journal]
  39. Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu
    Triangulations Intersect Nicely. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:4, pp:339-359 [Journal]
  40. Oswin Aichholzer, Franz Aurenhammer, Belén Palop
    Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:17-35 [Journal]
  41. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou
    Skew Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:3, pp:235-0 [Journal]
  42. Franz Aurenhammer, Otfried Schwarzkopf
    A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:4, pp:363-381 [Journal]
  43. Oswin Aichholzer, Franz Aurenhammer, Reinhard Hainz
    New Results on MWT Subgraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:5, pp:215-219 [Journal]
  44. Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser
    Transforming spanning trees and pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:1, pp:19-22 [Journal]
  45. Franz Aurenhammer
    The One-Dimensional Weighted Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:3, pp:119-123 [Journal]
  46. Franz Aurenhammer, Gerd Stöckl
    Searching for Segments with Largest Relative Overlap. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:2, pp:103-108 [Journal]
  47. Franz Aurenhammer, Robert L. S. Drysdale, Hannes Krasser
    Farthest line segment Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:6, pp:220-225 [Journal]
  48. Franz Aurenhammer
    Improved Algorithms for Discs and Balls Using Power Diagrams. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:2, pp:151-161 [Journal]
  49. Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu
    Constant-Level Greedy Triangulations Approximate the MWT Well. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:361-369 [Journal]
  50. Franz Aurenhammer
    Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1987, v:3, n:3, pp:249-255 [Journal]
  51. Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner
    A Novel Type of Skeleton for Polygons. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1995, v:1, n:12, pp:752-761 [Journal]
  52. Franz Aurenhammer
    Computational Geometry - Some Easy Questions and their Recent Solutions. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:5, pp:338-354 [Journal]
  53. Franz Aurenhammer
    Using Gale transforms in computational geometry. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:179-190 [Journal]
  54. Franz Aurenhammer, Johann Hagauer
    Recognizing Binary Hamming Graphs in O(n² log n) Time. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:5, pp:387-395 [Journal]
  55. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Enumerating Order Types for Small Point Sets with Applications. [Citation Graph (0, 0)][DBLP]
    Order, 2002, v:19, n:3, pp:265-281 [Journal]
  56. Franz Aurenhammer, Herbert Edelsbrunner
    An optimal algorithm for constructing the weighted voronoi diagram in the plane. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1984, v:17, n:2, pp:251-257 [Journal]
  57. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß
    Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1621-1653 [Journal]
  58. Franz Aurenhammer
    Power Diagrams: Properties, Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:78-96 [Journal]
  59. Oswin Aichholzer, Franz Aurenhammer
    Classifying Hyperplanes in Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:225-232 [Journal]
  60. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser
    Towards compatible triangulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:3-13 [Journal]
  61. Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu
    Approximating uniform triangular meshes in polygons. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:879-895 [Journal]
  62. 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]
  63. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynek Sír
    Computational and Structural Advantages of Circular Boundary Representation. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:374-385 [Conf]
  64. Franz Aurenhammer, Johannes Wallner, Martin Peternell, Helmut Pottmann
    Voronoi Diagrams for Oriented Spheres. [Citation Graph (0, 0)][DBLP]
    ISVD, 2007, pp:33-37 [Conf]
  65. Franz Aurenhammer, Johann Hagauer
    Computing equivalence classes among the edges of a graph with applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:3-12 [Journal]

  66. Divide-and-conquer for Voronoi diagrams revisited. [Citation Graph (, )][DBLP]


  67. Transforming spanning trees and pseudo-triangulations. [Citation Graph (, )][DBLP]


  68. Pseudo-tetrahedral complexes. [Citation Graph (, )][DBLP]


  69. Medial axis computation for planar free-form shapes. [Citation Graph (, )][DBLP]


  70. Recovering Structure from r-Sampled Objects. [Citation Graph (, )][DBLP]


  71. Matching edges and faces in polygonal partitions. [Citation Graph (, )][DBLP]


  72. Weighted skeletons and fixed-share decomposition. [Citation Graph (, )][DBLP]


  73. Editorial. [Citation Graph (, )][DBLP]


  74. Small weak epsilon-nets. [Citation Graph (, )][DBLP]


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


  76. Divide-and-conquer for Voronoi diagrams revisited. [Citation Graph (, )][DBLP]


  77. On k-Convex Polygons [Citation Graph (, )][DBLP]


  78. A relationship between Gale transforms and Voronoi diagrams. [Citation Graph (, )][DBLP]


  79. Pre-Triangulations and Liftable Complexes. [Citation Graph (, )][DBLP]


Search in 0.126secs, Finished in 0.129secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002