Sciweavers

7 search results - page 1 / 2
» Robust Plane Sweep for Intersecting Segments
Sort
View
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 3 months ago
Robust Plane Sweep for Intersecting Segments
In this paper, we reexamine in the framework of robust computation the Bentley
Jean-Daniel Boissonnat, Franco P. Preparata
IPL
2006
108views more  IPL 2006»
13 years 3 months ago
Robustness of k-gon Voronoi diagram construction
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regu...
Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
3DPVT
2006
IEEE
242views Visualization» more  3DPVT 2006»
13 years 9 months ago
Towards On-Line Digital Doubles
We present a modular system for real-time 3D-scanning of human bodies under motion. The high-resolution shape and colour appearance is captured by several scanning units positione...
Andreas Griesser, Nico Cornelis, Luc J. Van Gool
ICIAR
2004
Springer
13 years 9 months ago
Robust Dichromatic Colour Constancy
Abstract. A novel colour constancy algorithm that utilises both physical and statistical knowledge is introduced. A physics-based model of image formation is combined with a statis...
Gerald Schaefer
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
13 years 10 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...