2430 search results - page 120 / 486 » Computing Tutte Polynomials |
171
Voted
COMPGEOM
2001
ACM
15 years 8 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
135
Voted
ECCC
2008
15 years 5 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
159
click to vote
COMPGEOM
1997
ACM
15 years 9 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
164
Voted
CAGD
2008
15 years 5 months ago
2008
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
165
Voted
PODS
2003
ACM
16 years 5 months ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...