Matching solid shapes in arbitrary dimension via random sampling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

Matching solid shapes in arbitrary dimension via random sampling

Abstract

We give simple probabilistic algorithms that approximately maximize the volume of overlap of two solid, i.e. full-dimensional, shapes under translations and rigid motions. The shapes are subsets of $ℝ^d$ where $d≥ 2$. The algorithms approximate with respect to an pre-specified additive error and succeed with high probability. Apart from measurability assumptions, we only require that points from the shapes can be generated uniformly at random. An important example are shapes given as finite unions of simplices that have pairwise disjoint interiors.
Fichier principal
Vignette du fichier
dmAQ0114.pdf (342.12 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01197244 , version 1 (11-09-2015)

Identifiers

Cite

Daria Schymura. Matching solid shapes in arbitrary dimension via random sampling. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.167-178, ⟨10.46298/dmtcs.2992⟩. ⟨hal-01197244⟩

Collections

INSMI TDS-MACS
82 View
394 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More