Search the dblp DataBase

Publications of Author

1. Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
   Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. [Citation Graph (0, 0)][DBLP]
   COCOON, 2004, pp:259-267 [Conf]
   
2. Peter Braß, Christian Knauer
   Testing the congruence of d-dimensional point sets. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2000, pp:310-314 [Conf]
   
3. Peter Braß, Christian Knauer
   Testing the Congruence of d-Dimensional Point Sets. [Citation Graph (0, 0)][DBLP]
   EWCG, 2000, pp:104-107 [Conf]
   
4. Tetsuo Asano, Peter Braß, Shinji Sasahara
   Disc Covering Problem with Application to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
   ICCSA (3), 2004, pp:11-21 [Conf]
   
5. Peter Braß
   On Finding Maximum-Cardinality Symmetric Subsets. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2000, pp:106-112 [Conf]
   
6. Benyuan Liu, Peter Braß, Olivier Dousse, Philippe Nain, Donald F. Towsley
   Mobility improves coverage of sensor networks. [Citation Graph (0, 0)][DBLP]
   MobiHoc, 2005, pp:300-308 [Conf]
   
7. Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
   On Simultaneous Planar Graph Embeddings. [Citation Graph (0, 0)][DBLP]
   WADS, 2003, pp:243-255 [Conf]
   
8. Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
   Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:152-164 [Journal]
   
9. Peter Braß
   On finding maximum-cardinality symmetric subsets. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2003, v:24, n:1, pp:19-25 [Journal]
   
10. Peter Braß
    Erds Distance Problems in Normed Spaces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:195-214 [Journal]
    
11. Peter Braß, Christian Knauer
    On counting point-hyperplane incidences. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:13-20 [Journal]
    
12. Peter Braß, Christian Knauer
    Testing congruence and symmetry for general 3-dimensional objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:3-11 [Journal]
    
13. Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
    On simultaneous planar graph embeddings. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:2, pp:117-130 [Journal]
    
14. Peter Braß
    Combinatorial Geometry Problems in Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:495-510 [Journal]
    
15. Peter Braß
    The maximum Number of Second Smallest Distances in Finite Planar Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:371-379 [Journal]
    
16. Peter Braß
    On the Quantitative Steinitz Theorem in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:1, pp:111-117 [Journal]
    
17. Peter Braß
    On Point Sets with Many Unit Distances in Few Directions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:355-366 [Journal]
    
18. Peter Braß, Günter Rote, Konrad J. Swanepoel
    Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:51-58 [Journal]
    
19. Peter Braß, Laura Heinrich-Litan, Pat Morin
    Computing the Center of Area of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:5, pp:439-445 [Journal]
    
20. Peter Braß, Christian Knauer
    Testing the Congruence of d-Dimensional Point Sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:115-124 [Journal]
    
21. Peter Braß, Mehrbod Sharifi
    A Lower Bound for Lebesgue's Universal Cover Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:5, pp:537-544 [Journal]
    
22. Peter Braß, János Pach
    The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:1, pp:178-179 [Journal]
    
23. Peter Braß
    On strongly normal tesselations. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1999, v:20, n:9, pp:957-960 [Journal]
    
24. 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]
    
25. Peter Braß
    An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:192-195 [Journal]