赏心悦目
发表于 2025-3-28 18:17:44
http://reply.papertrans.cn/24/2324/232332/232332_41.png
雄辩
发表于 2025-3-28 20:45:54
Global Random Search: Extensions,An algorithm is presented for the following problem: Given . convex polyhedra of . vertices each, determine whether they have a point in common. The running time of the algorithm is .(κ log κ log..).
Flatus
发表于 2025-3-29 02:21:01
A sweep algorithm for the all-nearest-neighbors problem,The 2-dimensional all-nearest-neighbors problem is solved directly in asymptotically optimal time O(n*log n) using a simple plane-sweep algorithm. We present the algorithm, its analysis, and a "foolproof" implementation which guarantees an exact result at the cost of using five-fold-precision rational arithmetic.
EVICT
发表于 2025-3-29 03:19:27
On continuous homotopic one layer routing,We give an O(n. · log n) time and O(n.) space algorithm for the continuous homotopic one layer routing problem. The main contribution is an extension of the sweep paradigm to a universal cover space of the plane.
endoscopy
发表于 2025-3-29 10:33:53
http://reply.papertrans.cn/24/2324/232332/232332_45.png
下垂
发表于 2025-3-29 13:38:39
,On the detection of a common intersection of κ convex polyhedra,An algorithm is presented for the following problem: Given . convex polyhedra of . vertices each, determine whether they have a point in common. The running time of the algorithm is .(κ log κ log..).
BROTH
发表于 2025-3-29 17:02:22
http://reply.papertrans.cn/24/2324/232332/232332_47.png
nephritis
发表于 2025-3-29 20:59:19
http://reply.papertrans.cn/24/2324/232332/232332_48.png
芳香一点
发表于 2025-3-30 02:48:35
http://reply.papertrans.cn/24/2324/232332/232332_49.png
Conquest
发表于 2025-3-30 05:51:15
https://doi.org/10.1007/b129604 engineering design. The generation of smooth surfaces from a set of three-dimensional data points is a key problem in this field. The purpose of this paper is to present algorithms for designing and testing smooth free-form surfaces.