Peter Brass
Peter Brass
Professor of Computer Science, City College of New York
Verified email at
Cited by
Cited by
Research problems in discrete geometry
P Brass, WOJ Moser, J Pach
Springer Science & Business Media, 2006
Mobility improves coverage of sensor networks
B Liu, P Brass, O Dousse, P Nain, D Towsley
Proceedings of the 6th ACM international symposium on Mobile ad hoc …, 2005
On simultaneous planar graph embeddings
P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ...
Computational Geometry 36 (2), 117-130, 2007
Advanced data structures
P Brass
Cambridge University Press, 2008
Multirobot tree and graph exploration
P Brass, F Cabrera-Mora, A Gasparri, J Xiao
IEEE Transactions on Robotics 27 (4), 707-717, 2011
Bounds on coverage and target detection capabilities for models of networks of mobile sensors
P Brass
ACM Transactions on Sensor Networks (TOSN) 3 (2), 9-es, 2007
Computing the Hausdorff distance of geometric patterns and shapes
H Alt, P Braß, M Godau, C Knauer, C Wenk
Discrete and computational geometry, 65-76, 2003
A Turán-type extremal theory of convex geometric graphs
P Brass, G Károlyi, P Valtr
Discrete and computational geometry, 275-300, 2003
Pseudotriangulations from surfaces and a novel type of edge flip
O Aichholzer, F Aurenhammer, H Krasser, P Brass
SIAM Journal on Computing 32 (6), 1621-1653, 2003
Erdos distance problems in normed spaces
P Brass
Computational Geometry 6 (4), 195-214, 1996
On counting point-hyperplane incidences
P Brass, C Knauer
Computational Geometry 25 (1-2), 13-20, 2003
Testing the congruence of d-dimensional point sets
P Brass, C Knauer
Proceedings of the sixteenth annual symposium on Computational geometry, 310-314, 2000
On equilateral simplices in normed spaces
P Braß
On the maximum number of edges in a c4‐free subgraph of qn
P Brass, H Harborth, H Nienborg
Journal of Graph Theory 19 (1), 17-23, 1995
Distinct distances on algebraic curves in the plane
J Pach, F De Zeeuw
Combinatorics, Probability and Computing 26 (1), 99-117, 2017
Combinatorial geometry problems in pattern recognition
P Braß
Discrete and Computational Geometry 28 (4), 495-510, 2002
Shortest path planning for a tethered robot
P Brass, I Vigan, N Xu
Computational Geometry 48 (9), 732-742, 2015
A lower bound for Lebesgue's universal cover problem
P Brass, M Sharifi
International Journal of Computational Geometry & Applications 15 (05), 537-544, 2005
The maximum number of times the same distance can occur among the vertices of a convex n-gon is O (n log n)
P Braß, J Pach
Journal of Combinatorial Theory, Series A 94 (1), 178-179, 2001
On the maximum number of unit distances among n points in dimension four
P Brass
Intuitive Geometry 6, 277-290, 1997
The system can't perform the operation now. Try again later.
Articles 1–20