Computing the Maximum Overlap of Two Convex Polygons Under Translations

Mark De Berg 1 Olivier Devillers 2 Marc Van Kreveld 1 Otfried Schwarzkopf 1 Monique Teillaud 2
1 Department of Information and Computing Sciences [Utrecht]
2 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/hal-01179450
Contributor : Olivier Devillers <>
Submitted on : Wednesday, July 22, 2015 - 3:00:06 PM
Last modification on : Wednesday, October 30, 2019 - 7:36:17 PM

Identifiers

  • HAL Id : hal-01179450, version 1

Collections

INRIA

Citation

Mark De Berg, Olivier Devillers, Marc Van Kreveld, Otfried Schwarzkopf, Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135. ⟨hal-01179450⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

232

 

 

Contact

archive-ouverte@inria.fr