Peter Braß

Chan-Su Shin

Theor. Comput. Sci., 2015

Shortest path planning for a tethered robot.

[BibT_eX]

[DOI]

Ivo Vigan

Ning Xu

Comput. Geom., 2015

2014

Improved analysis of a multirobot graph exploration strategy.

[BibT_eX]

[DOI]

Ivo Vigan

Ning Xu

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

2013

Range-Aggregate Queries for Geometric Extent Problems.

[BibT_eX]

[DOI]

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

2011

Multirobot Tree and Graph Exploration.

[BibT_eX]

[DOI]

IEEE Trans. Robotics, 2011

The Aligned k-Center Problem.

[BibT_eX]

[DOI]

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

Sensor redundancy check without geometric information.

[BibT_eX]

[DOI]

Proceedings of the Research in Applied Computation Symposium, 2011

2010

Disc Covering Problem with Application to Digital Halftoning.

[BibT_eX]

[DOI]

Tetsuo Asano

Shinji Sasahara

Theory Comput. Syst., 2010

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Guarding a Polygon from Two Nearly-Opposite Directions.

[BibT_eX]

[DOI]

Chan-Su Shin

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

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

[BibT_eX]

[DOI]

Ferran Hurtado

Benjamin J. Lafreniere

Anna Lubiw

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

Covering a simple polygon by monotone directions.

[BibT_eX]

[DOI]

Comput. Geom., 2010

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

[BibT_eX]

[DOI]

Flavio Cabrera-Mora

Jizhong Xiao

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

2009

Universal hash functions for an infinite universe and hash trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Constructing Optimal Highways.

[BibT_eX]

[DOI]

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

Computing k-Centers On a Line

[BibT_eX]

[DOI]

CoRR, 2009

Escaping offline searchers and isoperimetric theorems.

[BibT_eX]

[DOI]

Comput. Geom., 2009

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

[BibT_eX]

[DOI]

Comput. Geom., 2009

Multi-robot tree and graph exploration.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Hee-Kap Ahn

Chan-Su Shin

Comput. Geom., 2008

2007

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

[BibT_eX]

[DOI]

ACM Trans. Sens. Networks, 2007

Multidimensional heaps and complementary range searching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

On simultaneous planar graph embeddings.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Comput. Geom., 2007

Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Comput. Geom., 2006

2005

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

A Lower Bound for Lebesgue's Universal Cover Problem.

[BibT_eX]

[DOI]

Mehrbod Sharifi

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

Mobility improves coverage of sensor networks.

[BibT_eX]

[DOI]

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

Research problems in discrete geometry.

[BibT_eX]

William O. J. Moser

János Pach

Springer, 2005

2004

Testing congruence and symmetry for general 3-dimensional objects.

[BibT_eX]

[DOI]

Christian Knauer

Comput. Geom., 2004

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

[BibT_eX]

[DOI]

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

2003

Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Computing the Center of Area of a Convex Polygon.

[BibT_eX]

[DOI]

Laura Heinrich-Litan

Pat Morin

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

On counting point-hyperplane incidences.

[BibT_eX]

[DOI]

Christian Knauer

Comput. Geom., 2003

On finding maximum-cardinality symmetric subsets.

[BibT_eX]

[DOI]

Comput. Geom., 2003

2002

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

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2002

Testing the Congruence of d-Dimensional Point Sets.

[BibT_eX]

[DOI]

Christian Knauer

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

Combinatorial Geometry Problems in Pattern Recognition.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

János Pach

J. Comb. Theory A, 2001

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

[BibT_eX]

[DOI]

Günter Rote

Konrad J. Swanepoel

Discret. Comput. Geom., 2001

2000

On the Approximation of Polygons by Subpolygons.

[BibT_eX]

EuroCG, 2000

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

On strongly normal tesselations.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1999

1998

On Point Sets with Many Unit Distances in Few Directions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

1997

On the Quantitative Steinitz Theorem in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1997

1996

On the Erdős-diameter of sets.

[BibT_eX]

[DOI]

Discret. Math., 1996

Erds Distance Problems in Normed Spaces.

[BibT_eX]

Comput. Geom., 1996

1995

On the maximum number of edges in a c4-free subgraph of qn.

[BibT_eX]

[DOI]

Heiko Harborth

Hauke Nienborg

J. Graph Theory, 1995

Packing constants in graphs and connectivity.

[BibT_eX]

[DOI]

Discret. Math., 1995

1992

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

[BibT_eX]

[DOI]