COMPGEOM 2007 - PDF Preprint Papers

COMPGEOM 2007 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2007 Paper

click to vote

COMPGEOM
2007
ACM

174views Discrete Geometry» more COMPGEOM 2007»

Between umbra and penumbra

13 years 6 months ago

Download hal.inria.fr

Computing shadow boundaries is a diﬃcult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...

Julien Demouth, Olivier Devillers, Hazel Everett, ...

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	174	Between umbra and penumbra	claim
2	138	Computing the exact arrangement of circles on a sphere, with applications in structural biology: video	claim
3	136	Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool	claim
4	134	On the hardness of minkowski addition and related operations	claim
5	132	On approximate halfspace range counting and relative epsilon-approximations	claim
6	126	Distributed computation of virtual coordinates	claim
7	121	Bi-criteria linear-time approximations for generalized k-mean/median/center	claim
8	120	A PTAS for k-means clustering based on weak coresets	claim
9	119	Happy endings for flip graphs	claim
10	118	Traversing a set of points with a minimum number of turns	claim
11	115	Probabilistic embeddings of bounded genus graphs into planar graphs	claim
12	115	Kinetic KD-trees and longest-side KD-trees	claim
13	107	Embeddings of surfaces, curves, and moving points in euclidean space	claim
14	106	Querying approximate shortest paths in anisotropic regions	claim
15	99	Aperture-angle and Hausdorff-approximation of convex figures	claim
16	99	Fully dynamic geometric spanners	claim
17	97	The theory of multidimensional persistence	claim
18	97	Manifold reconstruction in arbitrary dimensions using witness complexes	claim
19	96	Decomposition of multiple coverings into many parts	claim
20	96	A geometric framework for solving subsequence problems in computational biology efficiently	claim
21	95	An optimal generalization of the centerpoint theorem, and its extensions	claim
22	94	Inflating the cube by shrinking	claim
23	93	Guard placement for efficient point-in-polygon proofs	claim
24	90	Approximating the centroid is hard	claim
25	90	Towards an implementation of the 3D visibility skeleton	claim
26	87	Embedding 3-polytopes on a small grid	claim
27	86	On the exact maximum complexity of Minkowski sums of convex polyhedra	claim
28	83	Line transversals to disjoint balls	claim
29	83	There are not too many magic configurations	claim
30	83	Thick non-crossing paths and minimum-cost flows in polygonal domains	claim
31	82	Similar simplices in a d-dimensional point set	claim
32	82	Tight bounds for dynamic convex hull queries (again)	claim
33	79	A space-optimal data-stream algorithm for coresets in the plane	claim
34	78	The voronoi diagram of three lines	claim
35	75	Computing the volume of the union of cubes	claim
36	74	Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams	claim
37	70	Streaming algorithms for line simplification	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers