Sciweavers

99 search results - page 12 / 20
» Computing singular points of plane rational curves
Sort
View
VIS
2005
IEEE
109views Visualization» more  VIS 2005»
16 years 3 months ago
Topological Structures of 3D Tensor Fields
Tensor topology is useful in providing a simplified and yet detailed representation of a tensor field. Recently the field of 3D tensor topology is advanced by the discovery that d...
Xiaoqiang Zheng, Beresford N. Parlett, Alex Pang
108
Voted
ECCV
2006
Springer
16 years 3 months ago
Level-Set Curve Particles
In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may...
Tingting Jiang, Carlo Tomasi
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
15 years 5 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
128
Voted
COMPGEOM
2001
ACM
15 years 5 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
GD
2005
Springer
15 years 7 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...