CCCG 2007 | Sciweavers

10

CCCG
2007

80views Computational Geometry» more CCCG 2007»

A Disk-Covering Problem with Application in Optical Interferometry

13 years 6 months ago

Given a disk O in the plane called the objective, we want to ﬁnd n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diﬀe...

Trung Nguyen, Jean-Daniel Boissonnat, Fréd&...

claim paper

Read More »

11

click to vote

CCCG
2007

114views Computational Geometry» more CCCG 2007»

Terminal Steiner Tree with Bounded Edge Length

13 years 6 months ago

Download cccg.ca

In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to �...

Zhiyong Lin

claim paper

Read More »

9

click to vote

CCCG
2007

58views Computational Geometry» more CCCG 2007»

Linear-Space Algorithms for Distance Preserving Embedding

13 years 6 months ago

Download cg.scs.carleton.ca

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Mahe...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers