Metric bases for polyhedral gauges

Authors:
Fabien Rebatel;Édouard Thiel
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille (LIF, UMR 6166), Aix-Marseille Université, Marseille cedex 9, France;Laboratoire d'Informatique Fondamentale de Marseille (LIF, UMR 6166), Aix-Marseille Université, Marseille cedex 9, France
Venue:
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Year:
2011

Citing 3
Cited 1

Landmarks in graphs

Discrete Applied Mathematics
Resolvability in graphs and the metric dimension of a graph

Discrete Applied Mathematics
Medial axis lookup table and test neighborhood computation for 3D chamfer norms

Pattern Recognition

On dimension partitions in discrete metric spaces

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let (W, d) be a metric space. A subset S ⊆ W is a resolving set for W if d(x, p) = d(y, p) for all p ∈ S implies x = y. A metric basis is a resolving set of minimal cardinality, named the metric dimension (of W). Metric bases and dimensions have been extensively studied for graphs with the intrinsic distance, as well as in the digital plane with the city-block and chessboard distances. We investigate these concepts for polyhedral gauges, which generalize in the Euclidean space the chamfer norms in the digital space.