IPCO
2007
14 years 26 days ago
2007
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
CCCG
2010
14 years 27 days ago
2010
Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.
ESA
2008
Springer
14 years 1 months ago
2008
Springer
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
COMPGEOM
2008
ACM
14 years 1 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
VR
1993
IEEE
14 years 3 months ago
1993
IEEE
Screen space rendering statistics were gathered from 150 3D objects, each modeled by between 2K and 40K triangles. While there is wide variance by individual object, the overall t...
COMPGEOM
1996
ACM
14 years 3 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
WG
1998
Springer
14 years 3 months ago
1998
Springer
The number of triangles in arrangements of lines and pseudolines has been object of some research. Most results, however, concern arrangements in the projective plane. In this arti...
CHI
1998
ACM
14 years 3 months ago
1998
ACM
This paper presents a system for interacting with digital information, called Triangles. The Triangles system is a physical/digital construction kit, which allows users to use two...
GMP
2000
IEEE
14 years 3 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...