Pseudotriangle

Results: 43



#Item
21Open Problems from CCCG 2001 Erik D. Demaine∗ Joseph O’Rourke†  The following is a list of the problems presented on

Open Problems from CCCG 2001 Erik D. Demaine∗ Joseph O’Rourke† The following is a list of the problems presented on

Add to Reading List

Source URL: www.cs.uleth.ca

Language: English - Date: 2012-08-17 18:04:17
22CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Direct Planar Tree Transformation and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen’s University Kingston, Ontario, Canada K

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Direct Planar Tree Transformation and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen’s University Kingston, Ontario, Canada K

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:04:12
23CCCG 2006, Kingston, Ontario, August 14–16, 2006  Polygons Flip Finitely: Flaws and a Fix Erik D. Demaine∗  Blaise Gassend†

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Polygons Flip Finitely: Flaws and a Fix Erik D. Demaine∗ Blaise Gassend†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:58:31
24CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Optimal schedules for 2-guard room search Stephen Bahun∗  Abstract

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:30:44
25CCCG 2007, Ottawa, Ontario, August 20–22, 2007  On (Pointed) Minimum Weight Pseudo-Triangulations Oswin Aichholzer∗‡  Franz Aurenhammer†‡

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On (Pointed) Minimum Weight Pseudo-Triangulations Oswin Aichholzer∗‡ Franz Aurenhammer†‡

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:30:39
26New results on Pseudo-triangulations with low vertex degree Andr´e Schulz∗ constrained pseudo-triangulations this question is NPcomplete. Even though for every point set there exists a pseudotriangulations with degree

New results on Pseudo-triangulations with low vertex degree Andr´e Schulz∗ constrained pseudo-triangulations this question is NPcomplete. Even though for every point set there exists a pseudotriangulations with degree

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:56:02
27CCCG 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
28CCCG 2010, Winnipeg MB, August 9–11, 2010  Optimal encoding of triangular and quadrangular meshes with fixed topology L. Castelli Aleardi∗  Eric Fusy†

CCCG 2010, Winnipeg MB, August 9–11, 2010 Optimal encoding of triangular and quadrangular meshes with fixed topology L. Castelli Aleardi∗ Eric Fusy†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:16
29CCCG 2011, Toronto ON, August 10–12, 2011  Convexifying Polygons Without Losing Visibilities Oswin Aichholzer∗ Ferran Hurtado¶

CCCG 2011, Toronto ON, August 10–12, 2011 Convexifying Polygons Without Losing Visibilities Oswin Aichholzer∗ Ferran Hurtado¶

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:15
30Expansive motions Robert Connelly ∗  October 2, 2006

Expansive motions Robert Connelly ∗ October 2, 2006

Add to Reading List

Source URL: www.math.cornell.edu

Language: English - Date: 2007-01-30 10:12:45