Polygon - PDFSEARCH.IO - Document Search Engine

Polygon
Results: 1418

#	Item
361	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Partitioning a Polygon into Two Mirror Congruent Pieces Dania El-Khechen∗ 1 Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 23:59:35 Euclidean geometry Triangles Euclidean plane geometry Area Congruence Simple polygon Lemmas Geometry Polygons Euclid
362	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Degree Bounds for Constrained Pseudo-Triangulations Oswin Aichholzer∗ Michael Hoﬀmann† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:34 Mathematics Polygons Euclidean plane geometry 3D computer graphics Pseudotriangle Simple polygon Polygon Vertex Line graph Geometry Graph theory Triangulation
363	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 VC-Dimension of Visibility on Terrains James King∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:05:06 Polygons Mathematics Art gallery problem VC dimension Simple polygon Area Applied mathematics Computational geometry Computational learning theory Geometry
364	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Convex hull alignment through translation Michael Hoffmann∗ Vincent Kusters∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:59 Polygons Euclidean plane geometry Convex geometry Regular polygon Convex hull Convex set Geometry Convex analysis Mathematics
365	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the VC-Dimension of Visibility in Monotone Polygons Matt Gibson∗ Erik Krohn† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 12:59:12 Simple polygon Polygons Monotone polygon Polygon
366	Finding a Minimal Tree in a Polygon with its Medial Axis Herman J. Haverkort Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:00:09 Graph connectivity Steiner tree problem Tree decomposition Tree Halin graph Chordal graph Graph Path Path decomposition Graph theory Planar graphs Graph operations
367	CCCG 2011, Toronto ON, August 10–12, 2011 Weak Visibility Queries in Simple Polygons Mojtaba Nouri Bygi ∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Simple polygon Shortest path problem Visibility polygon Point location Straight skeleton Geometry Polygons Mathematics
368	CCCG 2011, Toronto ON, August 10–12, 2011 Algorithms for Bivariate Majority Depth Dan Chen∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Euclidean plane geometry Polytopes Polyhedra Arrangement of lines K-set Dual polyhedron Randomized algorithm Sweep line algorithm Polygon Geometry Mathematics Discrete geometry
369	CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximate Shortest Path Algorithms for Sequences of Pairwise Disjoint Simple Polygons Xiuxia Pan, Fajie Li∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:18 Analysis of algorithms Computational complexity theory Time complexity Pi Algorithm Polygon Theoretical computer science Mathematics Applied mathematics
370	CCCG 2010, Winnipeg MB, August 9–11, 2010 Speed-Constrained Geodesic Fr´ echet Distance Inside a Simple Polygon∗ Anil Maheshwari Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:18 Polygons Simple polygon Geodesic

UPDATE