Peter Braß

According to our database, Peter Braß authored at least 51 papers between 1992 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2015

Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme.

Peter Brass, Hyeon-Suk Na, Chan-Su Shin

Theor. Comput. Sci., 2015

Shortest path planning for a tethered robot.

Peter Brass, Ivo Vigan, Ning Xu

Comput. Geom., 2015

2014

Improved analysis of a multirobot graph exploration strategy.

Peter Brass, Ivo Vigan, Ning Xu

Proceedings of the 13th International Conference on Control Automation Robotics & Vision, 2014

2013

Range-Aggregate Queries for Geometric Extent Problems.

Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan

Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2011

Multirobot Tree and Graph Exploration.

Peter Brass, Flavio Cabrera-Mora, Andrea Gasparri, Jizhong Xiao

IEEE Trans. Robotics, 2011

The Aligned k-Center Problem.

Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron

Int. J. Comput. Geom. Appl., 2011

Sensor redundancy check without geometric information.

Peter Brass, Hyeon-Suk Na

Proceedings of the Research in Applied Computation Symposium, 2011

2010

Disc Covering Problem with Application to Digital Halftoning.

Tetsuo Asano, Peter Brass, Shinji Sasahara

Theory Comput. Syst., 2010

Finding the maximum bounded intersection of k out of n halfplanes.

Peter Brass, Hyeon-Suk Na

Inf. Process. Lett., 2010

Guarding a Polygon from Two Nearly-Opposite Directions.

Peter Brass, Hyeon-Suk Na, Chan-Su Shin

Int. J. Comput. Geom. Appl., 2010

A Lower Bound on the Area of a 3-Coloured Disk Packing.

Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw

Int. J. Comput. Geom. Appl., 2010

Covering a simple polygon by monotone directions.

Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin

Comput. Geom., 2010

Multi-robot flooding algorithm for the exploration of unknown indoor environments.

Flavio Cabrera-Mora, Jizhong Xiao, Peter Brass

Proceedings of the IEEE International Conference on Robotics and Automation, 2010

2009

Universal hash functions for an infinite universe and hash trees.

Peter Brass

Inf. Process. Lett., 2009

Constructing Optimal Highways.

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff

Int. J. Found. Comput. Sci., 2009

Computing k-Centers On a Line

Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron

CoRR, 2009

Escaping offline searchers and isoperimetric theorems.

Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin

Comput. Geom., 2009

On the minimum total length of interval systems expressing all intervals, and range-restricted queries.

Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin

Comput. Geom., 2009

Multi-robot tree and graph exploration.

Peter Brass, Andrea Gasparri, Flavio Cabrera-Mora, Jizhong Xiao

Proceedings of the 2009 IEEE International Conference on Robotics and Automation, 2009

2008

Maximum overlap and minimum convex hull of two convex polyhedra under translations.

Hee-Kap Ahn, Peter Brass, Chan-Su Shin

Comput. Geom., 2008

2007

Bounds on coverage and target detection capabilities for models of networks of mobile sensors.

Peter Brass

ACM Trans. Sens. Networks, 2007

Multidimensional heaps and complementary range searching.

Peter Brass

Inf. Process. Lett., 2007

On simultaneous planar graph embeddings.

Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell

Comput. Geom., 2007

Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.

Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

A Lower Bound on the Area of a 3-Coloured Disc Packing.

Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.

Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron

Comput. Geom., 2006

2005

An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem.

Peter Braß

SIAM J. Discret. Math., 2005

A Lower Bound for Lebesgue's Universal Cover Problem.

Peter Braß, Mehrbod Sharifi

Int. J. Comput. Geom. Appl., 2005

Mobility improves coverage of sensor networks.

Benyuan Liu, Peter Braß, Olivier Dousse, Philippe Nain, Donald F. Towsley

Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005

Research problems in discrete geometry.

Peter Brass, William O. J. Moser, János Pach

Springer, 2005

2004

Testing congruence and symmetry for general 3-dimensional objects.

Peter Braß, Christian Knauer

Comput. Geom., 2004

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.

Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß

SIAM J. Comput., 2003

Computing the Center of Area of a Convex Polygon.

Peter Braß, Laura Heinrich-Litan, Pat Morin

Int. J. Comput. Geom. Appl., 2003

On counting point-hyperplane incidences.

Peter Braß, Christian Knauer

Comput. Geom., 2003

On finding maximum-cardinality symmetric subsets.

Peter Braß

Comput. Geom., 2003

2002

On the nonexistence of Hausdorff-like metrics for fuzzy sets.

Peter Brass

Pattern Recognit. Lett., 2002

Testing the Congruence of d-Dimensional Point Sets.

Peter Braß, Christian Knauer

Int. J. Comput. Geom. Appl., 2002

Combinatorial Geometry Problems in Pattern Recognition.

Peter Braß

Discret. Comput. Geom., 2002

2001

The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n).

Peter Braß, János Pach

J. Comb. Theory, Ser. A, 2001

Triangles of Extremal Area or Perimeter in a Finite Planar Point Set.

Peter Braß, Günter Rote, Konrad J. Swanepoel

Discret. Comput. Geom., 2001

2000

On the Approximation of Polygons by Subpolygons.

Peter Brass

EuroCG, 2000

Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset.

Peter Brass

Proceedings of the Algorithms, 2000

1999

On strongly normal tesselations.

Peter Braß

Pattern Recognit. Lett., 1999

1998

On Point Sets with Many Unit Distances in Few Directions.

Peter Braß

Discret. Comput. Geom., 1998

1997

On the Quantitative Steinitz Theorem in the Plane.

Peter Braß

Discret. Comput. Geom., 1997

1996

On the Erdős-diameter of sets.

Peter Brass

Discret. Math., 1996

Erds Distance Problems in Normed Spaces.

Peter Braß

Comput. Geom., 1996

1995

On the maximum number of edges in a <i>c</i>₄-free subgraph of <i>q</i>_<i>n</i>.

Peter Brass, Heiko Harborth, Hauke Nienborg

J. Graph Theory, 1995

Packing constants in graphs and connectivity.

Peter Brass

Discret. Math., 1995

1992

The maximum Number of Second Smallest Distances in Finite Planar Sets.

Peter Braß

Discret. Comput. Geom., 1992