Sciweavers

131 search results - page 1 / 27
» Aggregate Processing of Planar Points
Sort
View
EDBT
2002
ACM
139views Database» more  EDBT 2002»
14 years 4 months ago
Aggregate Processing of Planar Points
Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Tradi...
Yufei Tao, Dimitris Papadias, Jun Zhang
EOR
2010
84views more  EOR 2010»
13 years 4 months ago
Worst-case analysis of demand point aggregation for the Euclidean p-median problem
Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale p-median problem to reduce its problem size and make it ...
Lian Qi, Zuo-Jun Max Shen
BMVC
2010
13 years 2 months ago
Unifying Planar and Point Mapping in Monocular SLAM
Mapping planar structure in vision-based SLAM can increase robustness and significantly improve efficiency of map representation. However, previous systems have implemented planar...
José Martínez-Carranza, Andrew Calwa...
TASE
2010
IEEE
12 years 11 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
13 years 6 months ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable