<--- Back to Details
First PageDocument Content
Polytopes / Euclidean plane geometry / Polyhedra / Rectilinear polygon / Vertex / Polyhedron / Simple polygon / Steiner tree problem / Dual polyhedron / Geometry / Graph theory / Polygons
Date: 2008-10-29 00:00:35
Polytopes
Euclidean plane geometry
Polyhedra
Rectilinear polygon
Vertex
Polyhedron
Simple polygon
Steiner tree problem
Dual polyhedron
Geometry
Graph theory
Polygons

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on

Add to Reading List

Source URL: cccg.ca

Download Document from Source Website

File Size: 347,99 KB

Share Document on Facebook

Similar Documents

Counterexample-guided Refinement of Template Polyhedra Sergiy Bogomolov12, Goran Frehse3, Mirco Giacobbe2, and Thomas A. Henzinger2 1  3

Counterexample-guided Refinement of Template Polyhedra Sergiy Bogomolov12, Goran Frehse3, Mirco Giacobbe2, and Thomas A. Henzinger2 1 3

DocID: 1xW2M - View Document

Regular Polyhedra in n Dimensions  Jeffrey Adams SUM Conference Brown University March 14, 2015

Regular Polyhedra in n Dimensions Jeffrey Adams SUM Conference Brown University March 14, 2015

DocID: 1v031 - View Document

Investigating Polyhedra by Oracles Volker Kaibel & Matthias Walter Traditional Approach  Modern Approach

Investigating Polyhedra by Oracles Volker Kaibel & Matthias Walter Traditional Approach Modern Approach

DocID: 1upCI - View Document

CCCG 2011, Toronto ON, August 10–12, 2011  Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗  Erik D. Demaine†

CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine†

DocID: 1uhJD - View Document

The Polyhedral Model Definitions Operations on Polyhedra Quantifier Elimination and SMT solvers Last Words

The Polyhedral Model Definitions Operations on Polyhedra Quantifier Elimination and SMT solvers Last Words

DocID: 1uefT - View Document