Sciweavers

584 search results - page 71 / 117
» On the Number of Halving Planes
Sort
View
CCCG
2006
14 years 11 months ago
Polygons Flip Finitely: Flaws and a Fix
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, ...
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
14 years 11 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
HAID
2008
Springer
14 years 11 months ago
Evaluation of Continuous Direction Encoding with Tactile Belts
Tactile displays consisting of tactors located around the user’s waist are a proven means for displaying directions in the horizontal plane. These displays use the body location ...
Martin Pielot, Niels Henze, Wilko Heuten, Susanne ...
COMGEO
2008
ACM
14 years 10 months ago
Covering point sets with two disjoint disks or squares
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
Sergio Cabello, José Miguel Díaz-B&a...
JGAA
2008
100views more  JGAA 2008»
14 years 10 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow