Sciweavers

121 search results - page 21 / 25
» A bound on the number of points of a plane curve
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
The complexity of the outer face in arrangements of random segments
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
COMPGEOM
2005
ACM
13 years 9 months ago
Learning smooth objects by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
VIS
2005
IEEE
109views Visualization» more  VIS 2005»
14 years 8 months ago
Topological Structures of 3D Tensor Fields
Tensor topology is useful in providing a simplified and yet detailed representation of a tensor field. Recently the field of 3D tensor topology is advanced by the discovery that d...
Xiaoqiang Zheng, Beresford N. Parlett, Alex Pang
SIBGRAPI
2007
IEEE
14 years 1 months ago
Improved Reversible Mapping from Color to Gray
— In the reversible conversion of color images to gray ones, colors are mapped to textures and from the textures the receiver can recover the colors, i.e. one may print a color i...
Ricardo L. de Queiroz