Sciweavers

297 search results - page 37 / 60
» Geometric and algebraic combinatorics
Sort
View
JSC
2011
110views more  JSC 2011»
13 years 3 months ago
Computing symmetric rank for symmetric tensors
We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for...
Alessandra Bernardi, Alessandro Gimigliano, Monica...
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
14 years 4 days ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
COMPGEOM
2005
ACM
13 years 10 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
PG
2007
IEEE
14 years 2 months ago
Visualisation of Implicit Algebraic Curves
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
Lionel Alberti, Bernard Mourrain
COCOON
2009
Springer
14 years 3 months ago
Convex Partitions with 2-Edge Connected Dual Graphs
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...