Sciweavers

34 search results - page 1 / 7
» Bichromatic Lines with Few Points
Sort
View
JCT
2000
73views more  JCT 2000»
13 years 4 months ago
Bichromatic Lines with Few Points
János Pach, Rom Pinchasi
FOCS
2009
IEEE
13 years 11 months ago
Instance-Optimal Geometric Algorithms
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...
Peyman Afshani, Jérémy Barbay, Timot...
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 6 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
GI
2009
Springer
13 years 2 months ago
Generating Product-based Availability Overviews for Fixed Line Network Access Points
: Product customization has become a commonplace topic in the last few years. Cars can be equipped with numerous gadgets, cell phones come in different colours and so on. In all th...
Christoph Wiesen, Thorsten Wunderlich, Robert Mert...
FSTTCS
2006
Springer
13 years 8 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...