triptans 发表于 2025-3-25 03:31:59

http://reply.papertrans.cn/24/2348/234777/234777_21.png

meritorious 发表于 2025-3-25 11:23:57

https://doi.org/10.1007/3-540-35050-0is well-shaped if the maximum aspect ratio of all its simplices is bounded from above by a constant. It is a long-term open problem to generate well-shaped .-dimensional Delaunay meshes for a given polyhedral domain. In this paper, we present a re?nement-based method that generates well-shaped .-dim

羊栏 发表于 2025-3-25 14:37:05

http://reply.papertrans.cn/24/2348/234777/234777_23.png

享乐主义者 发表于 2025-3-25 16:49:42

Die Systeme und ihre Beschreibung,e diameter of .: i.e. the maximum distance between any pair of points in .. It has been shown that . = 7.559.. for an arbitrary ., and . = 3.496.. in the special case when . is a ball centered at the origin in the plane. In this paper we show that . = 12/ 3v 4p2 = 3.524.. is sufficient for an arbitr

乐意 发表于 2025-3-25 22:46:30

http://reply.papertrans.cn/24/2348/234777/234777_25.png

凹处 发表于 2025-3-26 00:27:54

http://reply.papertrans.cn/24/2348/234777/234777_26.png

里程碑 发表于 2025-3-26 07:23:41

https://doi.org/10.1007/978-3-8348-9482-3ersect each other, are contained in ., and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on worst case input, is .(. log .). This is optimal in the algebraic decision tree model of computation.

Bumble 发表于 2025-3-26 10:00:46

,Zustandsänderungen Idealer Gase,, such that a pair of intervals in . can be matched only if they overlap with each other and have different colors. This problem arises in some applications such as radiosurgery treatment planning. We present a greedy algorithm for this problem that runs in .(. log log .) time for sorted input.We al

束以马具 发表于 2025-3-26 14:30:23

http://reply.papertrans.cn/24/2348/234777/234777_29.png

诗集 发表于 2025-3-26 20:09:46

http://reply.papertrans.cn/24/2348/234777/234777_30.png
页: 1 2 [3] 4 5 6 7
查看完整版本: Titlebook: Computing and Combinatorics; 7th Annual Internati Jie Wang Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Graph.Graph t