Planar - PDFSEARCH.IO - Document Search Engine

Planar
Results: 1245

#	Item
611	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On the Complexity of Point Recolouring in Geometric Graphs Henk Meijer Roosevelt Academy Middelburg, The Netherlands Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:04:47 Planar graphs Graph Minor Edge coloring Apollonian network Graph theory Mathematics Graph coloring
612	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Non-Shellable Drawings of Kn with Few Crossings ∗ ´ Bernardo M. Abrego Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-18 15:45:32 Inequalities Graph drawing Planar graph Graph theory Topological graph theory Crossing number
613	Non-Stretchable Pseudo-Visibility Graphs Ileana Streinu Dept. of Computer Science, Smith College, Northampton, MA 01063, USA. Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 15:59:40 Visibility graph Bipartite graph Matroid theory Path decomposition Intersection graph Graph theory Graph Planar graph
614	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm Joachim Giesen∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:32 Diagrams Discrete geometry Voronoi diagram Triangulation Medial axis Delaunay triangulation Polyhedron Proximity problems Convex hull Geometry Computational geometry Mathematics
615	A Watershed Algorithm for Triangulated Terrains Michael McAllister University of British Columbia Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:03:33 Segmentation Planar graph Connectivity Graph theory Mathematical morphology Watershed
616	CCCG 2011, Toronto ON, August 10–12, 2011 Planar Pixelations and Shape Reconstruction Brandon Rowekamp∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:14 Calculus Continuous function
617	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
618	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Partial Matching of Planar Polygons Under Translation and Rotation Eric C. McCreath∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:04:49 Polygon Area Pi Time complexity Applied mathematics Mathematics Euclidean plane geometry
619	An effective 3-in-1 keyword search method over heterogeneous data sources Add to Reading List Source URL: dbgroup.cs.tsinghua.edu.cn Language: English - Date: 2012-09-26 08:02:06 Graph Tree Shortest path problem Degree Planar separator theorem Chordal graph Graph theory Mathematics Theoretical computer science
620	CCCG 2009, Vancouver, BC, August 17–19, 2009 Colored Simultaneous Geometric Embeddings and Universal Pointsets Alejandro Estrella-Balderrama∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:19:08 Outerplanar graph Nearest neighbor graph Planar separator theorem Graph theory Graph coloring Planar graphs

UPDATE