We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
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...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...