多节 发表于 2025-3-28 17:06:44

http://reply.papertrans.cn/16/1533/153277/153277_41.png

悲痛 发表于 2025-3-28 20:46:13

http://reply.papertrans.cn/16/1533/153277/153277_42.png

语言学 发表于 2025-3-29 00:31:12

Materialmodellierung und virtuelles Testen,o construct only part of an arrangement whenever the problem at hand admits it. Examples of useful structures in arrangements are single cells or faces (see Chapter 8), zones (see Chapters 5 and 7), stabbing regions (see Chapter 15), and levels (see Chapters 3, 9, and 13).

Lacerate 发表于 2025-3-29 03:20:07

,Bernhard Götz – evangelischer Pfarrer,rithm for this problem, demonstrated in Chapters 12 and 13, make it one of the most fundamental problems in computational geometry. An algorithm that constructs an arrangement .(.) can be used to answer many questions about the set . of hyper planes, about the dual configuration .(.), and about other related concepts.

浮雕 发表于 2025-3-29 10:20:39

http://reply.papertrans.cn/16/1533/153277/153277_45.png

灯丝 发表于 2025-3-29 13:14:31

http://reply.papertrans.cn/16/1533/153277/153277_46.png

outer-ear 发表于 2025-3-29 15:36:19

http://reply.papertrans.cn/16/1533/153277/153277_47.png

委屈 发表于 2025-3-29 21:21:52

http://reply.papertrans.cn/16/1533/153277/153277_48.png

光滑 发表于 2025-3-30 02:17:24

http://reply.papertrans.cn/16/1533/153277/153277_49.png

巨硕 发表于 2025-3-30 04:37:45

Skeletons in Arrangementsble if a structure in an arrangement is to be computed that is more complicated than a single cell. There are two obvious strategies for such computations, which are not without disadvantages, however.
页: 1 2 3 4 [5] 6
查看完整版本: Titlebook: Algorithms in Combinatorial Geometry; Herbert Edelsbrunner Textbook 1987 Springer-Verlag Berlin Heidelberg 1987 Notation.Permutation.algor