Rotating calipers

Results: 11



#Item
1Simple Rectilinear Polygons are Perfect under Rectangular Vision Esther Arkin∗† Michael Biro‡† Omrit Filtser§ Matthew J. Katz§† Joseph S.B. Mitchell Abstract The Art Gallery problem (see O’Rourke [3] for an

Simple Rectilinear Polygons are Perfect under Rectangular Vision Esther Arkin∗† Michael Biro‡† Omrit Filtser§ Matthew J. Katz§† Joseph S.B. Mitchell Abstract The Art Gallery problem (see O’Rourke [3] for an

Add to Reading List

Source URL: www-cs.engr.ccny.cuny.edu

Language: English - Date: 2013-10-17 18:48:22
2CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003  An Algorithm for the MaxMin Area Triangulation of a Convex Polygon J. Mark Keil, Tzvetalin S. Vassilev Department of Computer Science University of Saskatchewan, 57

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 An Algorithm for the MaxMin Area Triangulation of a Convex Polygon J. Mark Keil, Tzvetalin S. Vassilev Department of Computer Science University of Saskatchewan, 57

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:30
3CCCG 2011, Toronto ON, August 10–12, 2011  The Possible Hull of Imprecise Points∗ William Evans†  Abstract

CCCG 2011, Toronto ON, August 10–12, 2011 The Possible Hull of Imprecise Points∗ William Evans† Abstract

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
4CCCG 2011, Toronto ON, August 10–12, 2011  The Possible Hull of Imprecise Points∗ William Evans†  Abstract

CCCG 2011, Toronto ON, August 10–12, 2011 The Possible Hull of Imprecise Points∗ William Evans† Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
5CCCG 2011, Toronto ON, August 10–12, 2011  Finding the Maximum Area Parallelogram in a Convex Polygon Kai Jin⇤  Abstract

CCCG 2011, Toronto ON, August 10–12, 2011 Finding the Maximum Area Parallelogram in a Convex Polygon Kai Jin⇤ Abstract

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
6CCCG 2011, Toronto ON, August 10–12, 2011  Finding the Maximum Area Parallelogram in a Convex Polygon Kai Jin⇤  Abstract

CCCG 2011, Toronto ON, August 10–12, 2011 Finding the Maximum Area Parallelogram in a Convex Polygon Kai Jin⇤ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
7CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003  An Implementation of a Linear Time Algorithm for Computing the Minimum Perimeter Triangle Enclosing a Convex Polygon Anna Medvedeva School of Computer Science

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 An Implementation of a Linear Time Algorithm for Computing the Minimum Perimeter Triangle Enclosing a Convex Polygon Anna Medvedeva School of Computer Science

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:32
8Updates to Geometric Tools Engine Version 1.9 Each subsection has a list of changes that occurred to the version number mention in that section. Those changes were rolled up into the zip file that was posted for the next

Updates to Geometric Tools Engine Version 1.9 Each subsection has a list of changes that occurred to the version number mention in that section. Those changes were rolled up into the zip file that was posted for the next

Add to Reading List

Source URL: www.geometrictools.com

Language: English - Date: 2015-04-05 03:06:51
9GACT Symposium, Los Angeles, California[removed]G. T. Toussaint, Solving geometric problems with the rotating calipers, Proc. MELECON’83, Athens (May[removed]]

GACT Symposium, Los Angeles, California[removed]G. T. Toussaint, Solving geometric problems with the rotating calipers, Proc. MELECON’83, Athens (May[removed]]

Add to Reading List

Source URL: www-cgrl.cs.mcgill.ca

Language: English - Date: 2002-08-07 16:32:08
10

PDF Document

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2011-12-02 14:31:09