Sciweavers

RC
2000
99views more  RC 2000»
13 years 4 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
IJCV
2006
194views more  IJCV 2006»
13 years 4 months ago
Reconstructing Open Surfaces from Image Data
In this paper a method for fitting open surfaces to data obtained from images is presented using a level set representation of the surface. This is done by tracking a curve, repres...
Jan Erik Solem, Anders Heyden
CAD
2008
Springer
13 years 4 months ago
Dual evolution of planar parametric spline curves and T-spline level sets
By simultaneously considering evolution processes for parametric spline curves and implicitly defined curves, we formulate the framework of dual evolution. This allows us to combin...
Robert Feichtinger, Matthias Fuchs, Bert Jütt...
CCCG
2006
13 years 5 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale