Search Sciweavers | Sciweavers

20

CCCG
2009

85views Computational Geometry» more CCCG 2009»

13 years 8 months ago

We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.

Fabrizio Frati

claim paper

Read More »

14

click to vote

CCCG
2009

70views Computational Geometry» more CCCG 2009»

General minisum circle location

13 years 8 months ago

Download cccg.ca

-extended abstractMark K

Mark Körner, Jack Brimberg, Henrik Juel, Anit...

claim paper

Read More »

23

click to vote

CCCG
2009

119views Computational Geometry» more CCCG 2009»

On the Height of a Homotopy

13 years 8 months ago

Download mathcs.slu.edu

Given 2 homotopic curves in a topological space, there are several ways to measure similarity between the curves, including Hausdorff distance and Fr

Erin W. Chambers, David Letscher

claim paper

Read More »

21

click to vote

CCCG
2007

104views Computational Geometry» more CCCG 2007»

Unfolding Polyhedra via Cut-Tree Truncation

13 years 8 months ago

Download maven.smith.edu

We prove that an inﬁnite class of convex polyhedra, produced by restricted vertex truncations, always unfold without overlap. The class includes the “domes,” providing a sim...

Alex Benton, Joseph O'Rourke

claim paper

Read More »

19

click to vote

CCCG
2007

111views Computational Geometry» more CCCG 2007»

A Lower Bound on the Area of a 3-Coloured Disc Packing

13 years 8 months ago

Download www.cs.uwaterloo.ca

Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured

Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers