Planar straight-line graph

Results: 15



#Item
1Department of Mathematics  Exploring Straight Line Graphs The straight line graph y = mx + c Explore the effects of varying m and c

Department of Mathematics Exploring Straight Line Graphs The straight line graph y = mx + c Explore the effects of varying m and c

Add to Reading List

Source URL: www.casiomedia.co.uk

Language: English - Date: 2014-07-01 10:09:34
2Straight-line Drawings of 1-planar Graphs Peter Eades1 , Seok-Hee Hong1 , Giuseppe Liotta2 , and Sheung-Hung Poon3 1 3

Straight-line Drawings of 1-planar Graphs Peter Eades1 , Seok-Hee Hong1 , Giuseppe Liotta2 , and Sheung-Hung Poon3 1 3

Add to Reading List

Source URL: www.cs.usyd.edu.au

Language: English - Date: 2011-06-06 12:14:24
3Tri-edge connectivity augmentation in planar straight line graphs Mashhood Ishaque Marwan Al-Jubeh, Krist´of R´edei, Diane L. Souvaine, and Csaba D. T´oth.

Tri-edge connectivity augmentation in planar straight line graphs Mashhood Ishaque Marwan Al-Jubeh, Krist´of R´edei, Diane L. Souvaine, and Csaba D. T´oth.

Add to Reading List

Source URL: www.eecs.tufts.edu

Language: English - Date: 2009-12-22 11:05:24
4Testing Shortcuts to Maintain Simplicity in Subdivision Simplification Craig Falls Yuanxin Liu Jack Snoeyink University of North Carolina—Chapel Hill Chapel Hill, NC  Abstract

Testing Shortcuts to Maintain Simplicity in Subdivision Simplification Craig Falls Yuanxin Liu Jack Snoeyink University of North Carolina—Chapel Hill Chapel Hill, NC Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:53
5CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area Fabrizio Frati∗  Abstract

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area Fabrizio Frati∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:28:05
6A Glider for Every Graph: Exploring the Algorithmic Requirements for Rotationally Invariant, Straight-Line Motion

A Glider for Every Graph: Exploring the Algorithmic Requirements for Rotationally Invariant, Straight-Line Motion

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-06-20 13:21:03
7CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Morphing Planar Graph Drawings Anna Lubiw∗  Abstract

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Morphing Planar Graph Drawings Anna Lubiw∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:28:11
8CCCG 2004, Montreal, Quebec, August 9–11, 2004  Using Bistellar Flips for Rotations in Point Location Structures 

CCCG 2004, Montreal, Quebec, August 9–11, 2004 Using Bistellar Flips for Rotations in Point Location Structures 

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
9CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:00:20
10CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003  On the Number of Pseudo-Triangulations of Certain Point Sets Oswin Aichholzer∗  David Orden†

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the Number of Pseudo-Triangulations of Certain Point Sets Oswin Aichholzer∗ David Orden†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:37