5 search results - page 1 / 1 » New Lower Bounds for Convex Hull Problems in Odd Dimensions |
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
CCCG
2006
13 years 6 months ago
2006
We study the problem of finding small weak -nets in three dimensions and provide new upper and lower bounds on the value of for which a weak -net of a given small constant size e...
COMPGEOM
2008
ACM
13 years 6 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, ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
MST
2002
13 years 4 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...