Sciweavers

1333 search results - page 43 / 267
» Not a Number of Floating Point Problems
Sort
View
COMGEO
2008
ACM
15 years 3 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 4 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
114
Voted
SCHEDULING
2010
74views more  SCHEDULING 2010»
15 years 1 months ago
Term-end exam scheduling at United States Military Academy/West Point
Scheduling term-end exams (TEE) at the United States Military Academy in West Point is unlike any other exam timetabling problem we know of. Exam timetabling normally produces a c...
Siqun Wang, Michael R. Bussieck, Monique Guignard,...
EDBT
2002
ACM
139views Database» more  EDBT 2002»
16 years 3 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
152
Voted
SGP
2007
15 years 5 months ago
Voronoi-based variational reconstruction of unoriented point sets
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
Pierre Alliez, David Cohen-Steiner, Yiying Tong, M...