COMBINATORICS
2006
13 years 4 months ago
2006
Sommerville [8] and Davies [2] classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. Relaxing this condition yields other triangles, which tile t...
DM
2010
13 years 4 months ago
2010
We consider point-line geometries having three points on every line, having three lines through every point (bislim geometries), and containing triangles. We classify such geometr...
DM
2010
13 years 4 months ago
2010
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
DCG
2010
13 years 4 months ago
2010
Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the x-axis, we look at the problem of the location of the vertices for a...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type ZZ T {f0} 12 dx dy for quadratic p...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
CGF
2008
13 years 4 months ago
2008
We present a novel representation and algorithm, ReduceM, for memory efficient ray tracing of large scenes. ReduceM exploits the connectivity between triangles in a mesh and decom...
CG
2008
Springer
13 years 4 months ago
2008
Springer
Homogeneous coordinates are often used in computer graphics and computer vision applications especially for the representation of geometric transformations. The homogeneous coordi...
CCCG
2004
13 years 5 months ago
2004
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...
CCCG
2004
13 years 5 months ago
2004
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...