406 search results - page 44 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
COMPGEOM
2004
ACM
15 years 5 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...
112
click to vote
SYRCODIS
2007
15 years 29 days ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
ICMCS
2008
IEEE
15 years 6 months ago
2008
IEEE
– Nowadays, the Internet provides a convenient medium for sharing complex 3D models online. However, transmitting 3D progressive meshes over networks may encounter the problem of...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
123
click to vote
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...