The polygon containment problem: 1. Simultaneous containment under translation

Computing the maximum overlap of two convex polygons under translations

De Berg, Mark
Devillers, Olivier
Van Kreveld, Marc
Schwarzkopf, Otfried
Teillaud, Monique
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1996

Theme 2 - Genie logiciel et calcul symbolique. Projet PrismeSIGLEAvailable from INIST (FR), Document...

Bundling three convex polygons to minimize area or perimeter

Park, D
Bae, SW
Alt, H
Ahn, HK

Given three convex polygons having n vertices in total in the plane, we consider the problem of find...

The contour problem for polygons

Wood, D.
Ottmann, T.
Karlsruhe Univ. (T.H.) (Germany). Inst. fuer Angewandte Informatik und Formale Beschreibungsverfahren

January 1984

TIB: RN 3492 (145) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliot...

Simultaneous containment of several polygons : analysis of the contact configurations

Devillers, Olivier
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1990

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1990 ...

Multiple Translational Containment Part I: An Approximate Algorithm

Karen Daniels
Victor J. Milenkovic

January 1996

In Part I we present an algorithm for finding a solution to the two-dimensional translational approx...

Multiple Translational Containment: Approximate and Exact Algorithms

Karen Daniels
Victor J. Milenkovic

January 1995

We present exact algorithms for finding a solution to the twodimensional translational containment p...

Multiple Translational Containment: Approximate and Exact Algorithms

Karen Daniels
Victor J. Milenkovic

January 1995

We present exact algorithms for finding a solution to the twodimensional translational containment p...

Multiple Containment Methods

Daniels, Karen
Li, Zhenyu
Milenkovic, Victor

February 2016

We present three different methods for finding solutions to the 2D translation-only con- tainment pr...

The polygonal containment model

Kaiser, M.J.

January 2002

AbstractThe polygonal containment problem is to position two structures of convex forms under rigid ...

Monotone Polygon Containment Problems Under Translation

Jui-Shang Chiu

Translational polygons containment and minimal enclosure using geometric algorithms and mathematical programming

Milenkovic, Victor J.
Daniels, Karen

March 2018

We present an algorithm for the two-dimensional translational containment problem: find translations...

External polygon containment problems

Sharir, Micha
Toledo, Sivan

June 1994

AbstractGiven a convex polygonal object P with k vertices and an environment consisting of polygonal...

Containment Algorithms for Nonconvex Polygons with Applications to Layout

McIntosh Daniels, Karen

October 2017

Layout and packing are NP-hard geometric optimization problems of practical importance for which fin...

Rotational Polygon Containment and Minimum Enclosure

Victor J. Milenkovic

January 1998

An algorithm and implementation is given for rotational polygon containment: given polygons P1 ; P2 ...

The polygonal containment model

Kaiser, M.J.

January 2002

AbstractThe polygonal containment problem is to position two structures of convex forms under rigid ...

Computing the maximum overlap of two convex polygons under translations

De Berg, Mark
Devillers, Olivier
Van Kreveld, Marc
Schwarzkopf, Otfried
Teillaud, Monique
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1996

Theme 2 - Genie logiciel et calcul symbolique. Projet PrismeSIGLEAvailable from INIST (FR), Document...

Bundling three convex polygons to minimize area or perimeter

Park, D
Bae, SW
Alt, H
Ahn, HK

Given three convex polygons having n vertices in total in the plane, we consider the problem of find...

The contour problem for polygons

Wood, D.
Ottmann, T.
Karlsruhe Univ. (T.H.) (Germany). Inst. fuer Angewandte Informatik und Formale Beschreibungsverfahren

January 1984

TIB: RN 3492 (145) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliot...

Simultaneous containment of several polygons : analysis of the contact configurations

Devillers, Olivier
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1990

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1990 ...

Multiple Translational Containment Part I: An Approximate Algorithm

Karen Daniels
Victor J. Milenkovic

January 1996

In Part I we present an algorithm for finding a solution to the two-dimensional translational approx...

Multiple Translational Containment: Approximate and Exact Algorithms

Karen Daniels
Victor J. Milenkovic

January 1995

We present exact algorithms for finding a solution to the twodimensional translational containment p...

Multiple Translational Containment: Approximate and Exact Algorithms

Karen Daniels
Victor J. Milenkovic

January 1995

We present exact algorithms for finding a solution to the twodimensional translational containment p...

Multiple Containment Methods

Daniels, Karen
Li, Zhenyu
Milenkovic, Victor

February 2016

We present three different methods for finding solutions to the 2D translation-only con- tainment pr...

The polygonal containment model

Kaiser, M.J.

January 2002

AbstractThe polygonal containment problem is to position two structures of convex forms under rigid ...

Monotone Polygon Containment Problems Under Translation

Jui-Shang Chiu

Translational polygons containment and minimal enclosure using geometric algorithms and mathematical programming

Milenkovic, Victor J.
Daniels, Karen

March 2018

We present an algorithm for the two-dimensional translational containment problem: find translations...

External polygon containment problems

Sharir, Micha
Toledo, Sivan

June 1994

AbstractGiven a convex polygonal object P with k vertices and an environment consisting of polygonal...

Containment Algorithms for Nonconvex Polygons with Applications to Layout

McIntosh Daniels, Karen

October 2017

Layout and packing are NP-hard geometric optimization problems of practical importance for which fin...

Rotational Polygon Containment and Minimum Enclosure

Victor J. Milenkovic

January 1998

An algorithm and implementation is given for rotational polygon containment: given polygons P1 ; P2 ...

The polygonal containment model

Kaiser, M.J.

January 2002

AbstractThe polygonal containment problem is to position two structures of convex forms under rigid ...

Computing the maximum overlap of two convex polygons under translations

De Berg, Mark
Devillers, Olivier
Van Kreveld, Marc
Schwarzkopf, Otfried
Teillaud, Monique
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1996

Theme 2 - Genie logiciel et calcul symbolique. Projet PrismeSIGLEAvailable from INIST (FR), Document...

Bundling three convex polygons to minimize area or perimeter

Park, D
Bae, SW
Alt, H
Ahn, HK

Given three convex polygons having n vertices in total in the plane, we consider the problem of find...

The contour problem for polygons

Wood, D.
Ottmann, T.
Karlsruhe Univ. (T.H.) (Germany). Inst. fuer Angewandte Informatik und Formale Beschreibungsverfahren

January 1984

TIB: RN 3492 (145) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliot...

The polygon containment problem: 1. Simultaneous containment under translation

Abstract

Extracted data

The polygon containment problem: 1. Simultaneous containment under translation

Abstract

Extracted data

Related items

Related items