Sciweavers

732 search results - page 3 / 147
» Testing Geometric Convexity
Sort
View
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 8 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
COMPGEOM
2005
ACM
13 years 9 months ago
Multi-pass geometric algorithms
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
Timothy M. Chan, Eric Y. Chen
CAGD
2007
86views more  CAGD 2007»
13 years 7 months ago
A general geometric construction of coordinates in a convex simplicial polytope
Barycentric coordinates are a fundamental concept in computer graphics and geometric modeling. We extend the geometric construction of Floater’s mean value coordinates [8,11] to...
Tao Ju, Peter Liepa, Joe D. Warren
ICPR
2006
IEEE
14 years 8 months ago
A novel SVM Geometric Algorithm based on Reduced Convex Hulls
Geometric methods are very intuitive and provide a theoretically solid viewpoint to many optimization problems. SVM is a typical optimization task that has attracted a lot of atte...
Michael E. Mavroforakis, Margaritis Sdralis, Sergi...
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 7 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri