Sciweavers

22 search results - page 2 / 5
» A connection between cutting plane theory and the geometry o...
Sort
View
COMPGEOM
2007
ACM
13 years 7 months ago
Between umbra and penumbra
Computing shadow boundaries is a difficult 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, ...
COMPGEOM
2010
ACM
13 years 11 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
13 years 12 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
COMPGEOM
2006
ACM
13 years 11 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
VISUALIZATION
1999
IEEE
13 years 10 months ago
Tetrahedral Mesh Compression with the Cut-Border Machine
In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine t...
Stefan Gumhold, Stefan Guthe, Wolfgang Straß...