COMPGEOM 2003 - PDF Preprint Papers

COMPGEOM 2003 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2003 Paper

click to vote

COMPGEOM
2003
ACM

197views Discrete Geometry» more COMPGEOM 2003»

the asteroid surveying problem and other puzzles

13 years 10 months ago

Download www.cs.uwaterloo.ca

We consider two variants of the well-known “sailor in the fog” puzzle. The ﬁrst version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...

Timothy M. Chan, Alexander Golynski, Alejandro L&o...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	197	the asteroid surveying problem and other puzzles	claim
2	182	Polygon decomposition based on the straight line skeleton	claim
3	165	Loops in reeb graphs of 2-manifolds	claim
4	163	Restricted delaunay triangulations and normal cycle	claim
5	158	Cost-driven octree construction schemes: an experimental study	claim
6	146	Estimating surface normals in noisy point cloud data	claim
7	142	Controlled perturbation for arrangements of circles	claim
8	141	High-dimensional shape fitting in linear time	claim
9	129	Planar minimally rigid graphs and pseudo-triangulations	claim
10	129	Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation	claim
11	128	Cache-oblivious data structures for orthogonal range searching	claim
12	122	Finding a curve in a map	claim
13	119	New constructions of weak epsilon-nets	claim
14	111	Billboard clouds	claim
15	108	Euclidean bounded-degree spanning tree ratios	claim
16	107	A tight bound for the number of different directions in three dimensions	claim
17	106	Local polyhedra and geometric graphs	claim
18	106	Updating and constructing constrained delaunay and constrained regular triangulations by flips	claim
19	104	Incremental constructions con BRIO	claim
20	104	Curve reconstruction from noisy samples	claim
21	103	Morse-smale complexes for piecewise linear 3-manifolds	claim
22	101	Approximation algorithms for aligning points	claim
23	101	Shape fitting with outliers	claim
24	100	Curve-sensitive cuttings	claim
25	100	Constructive root bound for k-ary rational input numbers	claim
26	97	Molecular shape analysis based upon the morse-smale complex and the connolly function	claim
27	95	Optimized color gamuts for tiled displays	claim
28	94	Good NEWS: partitioning a simple polygon by compass directions	claim
29	93	The smallest enclosing ball of balls: combinatorial structure and algorithms	claim
30	87	Long monotone paths in line arrangements	claim
31	79	Complexity of the delaunay triangulation of points on surfaces the smooth case	claim
32	77	VASCO: visualizing and animating spatial constructs and operations	claim
33	75	Fast penetration depth estimation using rasterization hardware and hierarchical refinement	claim
34	74	Near-optimal parameterization of the intersection of quadrics	claim
35	73	Hausdorff distance under translation for points and balls	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers