2479 search results - page 356 / 496 » Quantum complexity theory |
155
click to vote
ACMSE
2004
ACM
15 years 12 months ago
2004
ACM
Component-based software development has become an important approach to building complex software systems. Much research focuses on component specification to achieve the advanta...
154
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
149
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
151
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
165
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...