702 search results - page 57 / 141 » Covering Spheres with Spheres |
147
click to vote
CCCG
2010
15 years 7 months ago
2010
We prove several new results concerning k-sets of point sets on the 2-sphere (equivalently, for signed point sets in the plane) and k-sets in 3-space. Specific results include sph...
184
click to vote
IADIS
2004
15 years 7 months ago
2004
With the Internet rapidly becoming a ubiquitous and global tool inveigling all spheres of our lives so with the joys and pleasure comes the pain. There are many reasons why govern...
143
click to vote
CCCG
2003
15 years 7 months ago
2003
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
206
click to vote
CCCG
2000
15 years 7 months ago
2000
We present a simple linear time algorithm for decoding Edgebreaker encoded triangle meshes in a single traversal. The Edgebreaker encoding technique, introduced in [5], encodes th...
147
click to vote
CAD
2010
Springer
15 years 6 months ago
2010
Springer
MOS surfaces are rational surfaces in R3,1 which provide rational envelopes of the associated two-parameter family of spheres. Moreover, all the offsets admit rational parameteriz...