Peter Braß

25 papers B 2C 1Misc 1Journal 18Unranked 3
YearRankTypeTitle / Venue / Authors
2007 J jnl
On simultaneous planar graph embeddings.
Comput. Geom.
Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
2006 J jnl
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.
Comput. Geom.
Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
2005 J jnl
A Lower Bound for Lebesgue's Universal Cover Problem.
Int. J. Comput. Geom. Appl.
Peter Braß, Mehrbod Sharifi
2005 J jnl
An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem.
SIAM J. Discret. Math.
Peter Braß
2005 B conf
Mobility improves coverage of sensor networks.
MobiHoc
Benyuan Liu, Peter Braß, Olivier Dousse, Philippe Nain, Donald F. Towsley
2004 Misc conf
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
COCOON
Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
2004 — conf
Disc Covering Problem with Application to Digital Halftoning.
ICCSA (3)
Tetsuo Asano, Peter Braß, Shinji Sasahara
2004 J jnl
Testing congruence and symmetry for general 3-dimensional objects.
Comput. Geom.
Peter Braß, Christian Knauer
2003 J jnl
Computing the Center of Area of a Convex Polygon.
Int. J. Comput. Geom. Appl.
Peter Braß, Laura Heinrich-Litan, Pat Morin
2003 B conf
On Simultaneous Planar Graph Embeddings.
WADS
Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
2003 J jnl
On counting point-hyperplane incidences.
Comput. Geom.
Peter Braß, Christian Knauer
2003 J jnl
On finding maximum-cardinality symmetric subsets.
Comput. Geom.
Peter Braß
2003 J jnl
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.
SIAM J. Comput.
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß
2002 J jnl
Combinatorial Geometry Problems in Pattern Recognition.
Discret. Comput. Geom.
Peter Braß
2002 J jnl
Testing the Congruence of d-Dimensional Point Sets.
Int. J. Comput. Geom. Appl.
Peter Braß, Christian Knauer
2001 J jnl
The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n).
J. Comb. Theory A
Peter Braß, János Pach
2001 J jnl
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set.
Discret. Comput. Geom.
Peter Braß, Günter Rote, Konrad J. Swanepoel
2000 — conf
On Finding Maximum-Cardinality Symmetric Subsets.
JCDCG
Peter Braß
2000 C conf
Testing the Congruence of d-Dimensional Point Sets.
EuroCG
Peter Braß, Christian Knauer
2000 — conf
Testing the congruence of d-dimensional point sets.
SCG
Peter Braß, Christian Knauer
1999 J jnl
On strongly normal tesselations.
Pattern Recognit. Lett.
Peter Braß
1998 J jnl
On Point Sets with Many Unit Distances in Few Directions.
Discret. Comput. Geom.
Peter Braß
1997 J jnl
On the Quantitative Steinitz Theorem in the Plane.
Discret. Comput. Geom.
Peter Braß
1996 J jnl
Erds Distance Problems in Normed Spaces.
Comput. Geom.
Peter Braß
1992 J jnl
The maximum Number of Second Smallest Distances in Finite Planar Sets.
Discret. Comput. Geom.
Peter Braß