Sciweavers

5210 search results - page 402 / 1042
» Exact geometric computation
Sort
View
DICTA
2003
15 years 8 months ago
A Fast Skeletonization Method
This paper presents an efficient method for extracting the skeleton of a planar shape. The method is based on computing local symmetries of the shape’s linearized contour. The ce...
Ju Jia Zou
ESANN
1998
15 years 8 months ago
A neural approach to a sensor fusion problem
Our problem concerns the joint interpretation of UltraSonic and InfraRed measurements provided by a composite proximity sensor, in order to extract geometrical and morphological f...
Valentina Colla, Mirko Sgarbi, Leonardo Maria Reyn...
WSCG
2003
158views more  WSCG 2003»
15 years 8 months ago
Comparison of Accelerating Techniques for Discontinuity Meshing
Creating an appropriate mesh is one of demanding tasks of many global illumination algorithms. Discontinuity meshing proved to diminish artifacts caused by other meshing strategie...
Karel Nechvíle, Petr Tobola, Jiri Sochor
173
Voted
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 8 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
CORR
2008
Springer
130views Education» more  CORR 2008»
15 years 7 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux