Sciweavers

2188 search results - page 136 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
DAGSTUHL
2003
15 years 5 months ago
Reliable Distance and Intersection Computation Using Finite Precision Geometry
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
Katja Bühler, Eva Dyllong, Wolfram Luther
CGF
2005
101views more  CGF 2005»
15 years 4 months ago
Modeling Color Properties of Tiled Displays
The concept of tiled displays can be successful only if such displays are made to look like a single display perceptually. The two issues that need to be solved to achieve this go...
Aditi Majumder, M. Gopi
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 2 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
COMPGEOM
2006
ACM
15 years 10 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
ICCSA
2005
Springer
15 years 10 months ago
Mesh Generation for Symmetrical Geometries
Symmetries are not only fascinating, but they can also be exploited when designing numerical algorithms and data structures for scientific engineering problems in symmetrical doma...
Krister Åhlander