標題: Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Xuehou Tan Conference proceedings 2005 Springer-Verlag Ber [打印本頁] 作者: Localized 時間: 2025-3-21 17:21
書目名稱Discrete and Computational Geometry影響因子(影響力)
書目名稱Discrete and Computational Geometry影響因子(影響力)學科排名
書目名稱Discrete and Computational Geometry網(wǎng)絡公開度
書目名稱Discrete and Computational Geometry網(wǎng)絡公開度學科排名
書目名稱Discrete and Computational Geometry被引頻次
書目名稱Discrete and Computational Geometry被引頻次學科排名
書目名稱Discrete and Computational Geometry年度引用
書目名稱Discrete and Computational Geometry年度引用學科排名
書目名稱Discrete and Computational Geometry讀者反饋
書目名稱Discrete and Computational Geometry讀者反饋學科排名
作者: 強制令 時間: 2025-3-22 00:00
The Role of Liver Transplantationotal length. We present an optimal algorithm solving the problem in linear time if the edges incident to . are sorted clockwise by angle. For unsorted edges our algorithm runs in .(. log .) time. For unsorted edges we also give a linear time approximation algorithm and a lower time bound.作者: 烤架 時間: 2025-3-22 02:03 作者: bonnet 時間: 2025-3-22 05:45
Thoracic Aorta and Its Variantsdean rigidity results regarding the existence and combinatorial characterization of expansive motions. In particular, we extend the concept of a pseudo-triangulation from the Euclidean to the spherical case. As a consequence, we formulate a set of . that must be satisfied by three-dimensional generalizations of pointed pseudo-triangulations.作者: mucous-membrane 時間: 2025-3-22 12:23
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation,known whether it is NP-hard to compute minimum Manhattan networks, i.e. Manhattan networks of minimum total length. In this paper we present a factor-3 approximation algorithm for this problem. Given a set of . nodes, our algorithm takes .(. log .) time and linear space.作者: 含沙射影 時間: 2025-3-22 13:42 作者: 含沙射影 時間: 2025-3-22 17:25
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem,vex pieces. We give a fixed-parameter tractable algorithm for this problem that runs in the following time complexities:.– linear time if . is constant,.– time polynomial in . if .,.or, to be exact, in .(. . . . . 2.) time.作者: rods366 時間: 2025-3-23 00:16 作者: 割讓 時間: 2025-3-23 03:55 作者: 陰謀 時間: 2025-3-23 05:59
https://doi.org/10.1007/978-981-99-5808-5oves under different assumptions on disk radii and disk placements. For example, with . congruent disks, . moves always suffice for transforming the start configuration into the target configuration; on the other hand, . moves are sometimes necessary.作者: 跳動 時間: 2025-3-23 11:31
Surgical Treatment of Colorectal Cancerd yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.作者: motivate 時間: 2025-3-23 14:41
Amanda Norwich-Cavanaugh,Deepak Narayansent an optimal .(.) time algorithm to determine whether there is a point . on the boundary of . such that the room (., .) is 1-searchable. This improves upon the previous .(. log .) time bound, which was established for determining whether or not a room (., .) is 1-searchable, where . is a given point on the boundary of ..作者: Intractable 時間: 2025-3-23 22:02
Algorithms for the ,-Dimensional Rigidity Matroid of Sparse Graphs,dity matroid for ., and.(ii) construct . using vertex insertions preserving if . is isostatic, and.(iii) compute the rank of ...The algorithms have linear running time assuming that the dimension . is fixed.作者: Hdl348 時間: 2025-3-24 02:14
Sliding Disks in the Plane,oves under different assumptions on disk radii and disk placements. For example, with . congruent disks, . moves always suffice for transforming the start configuration into the target configuration; on the other hand, . moves are sometimes necessary.作者: 枯燥 時間: 2025-3-24 06:15 作者: 凹處 時間: 2025-3-24 07:27 作者: GREEN 時間: 2025-3-24 11:24
Anal Sphincter Complex Preservationtervals on the real line, and for various special cases (quadrants and skylines, which are unbounded in two and one directions respectively). In a follow-up version, we also show this to be true with various fatness We also investigate generalizations to higher dimensions.作者: 無聊的人 時間: 2025-3-24 18:48 作者: 一大塊 時間: 2025-3-24 21:40
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane,tervals on the real line, and for various special cases (quadrants and skylines, which are unbounded in two and one directions respectively). In a follow-up version, we also show this to be true with various fatness We also investigate generalizations to higher dimensions.作者: sclera 時間: 2025-3-25 01:20
Visual Pascal Configuration and Quartic Surface,e set of viewpoints. We will investigate this surface depending on the vertices of a spatial hexagon. A relation between non-singular cubic curve and complete quadrilateral is naturally and geometrically derived.作者: CUMB 時間: 2025-3-25 03:35 作者: Calibrate 時間: 2025-3-25 08:23
Adjuvant and Neoadjuvant TherapiesLet . (., .) be the smallest integer such that any set of . (., .) points in the plane, no three collinear, contains both an empty convex . -gon and an empty convex . -gon, which do not intersect. We show that . (3,5) = 10, 12 ≤ . (4,5) ≤ 14, 16 ≤ . (5,5) ≤ 20.作者: Psa617 時間: 2025-3-25 15:29
I/O-Efficiently Pruning Dense Spanners,Given a geometric graph .=(.,.) in . with constant dilation ., and a positive constant ., we show how to construct a (1?+?.)-spanner of . with . edges using . I/O operations.作者: admission 時間: 2025-3-25 19:40
On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons,Let . (., .) be the smallest integer such that any set of . (., .) points in the plane, no three collinear, contains both an empty convex . -gon and an empty convex . -gon, which do not intersect. We show that . (3,5) = 10, 12 ≤ . (4,5) ≤ 14, 16 ≤ . (5,5) ≤ 20.作者: 兩棲動物 時間: 2025-3-25 20:24
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281180.jpg作者: saturated-fat 時間: 2025-3-26 03:01 作者: 貪婪性 時間: 2025-3-26 05:30 作者: Notify 時間: 2025-3-26 10:57
Grid Vertex-Unfolding Orthostacks,ectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex-unfolding using only such cuts.作者: pulmonary-edema 時間: 2025-3-26 12:45
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon,alent. This paper extends the result on edge-capacitated graphs, where the capacities are real numbers, and it presents a proof of the equivalence of the three relations. From this proof, it is also shown that we can determine whether or not a given graph precedes another given graph in polynomial time.作者: 紅腫 時間: 2025-3-26 19:34 作者: 上腭 時間: 2025-3-26 23:32 作者: Melatonin 時間: 2025-3-27 02:00
Crossing Stars in Topological Graphs,t contains three sets of . edges, such that every edge in any of the sets crosses all edges in the other two sets. Furthermore, two of the three sets can be chosen such that all . edges in the set have a common vertex.作者: atrophy 時間: 2025-3-27 09:19 作者: Heterodoxy 時間: 2025-3-27 10:07 作者: FLAX 時間: 2025-3-27 14:31 作者: entail 時間: 2025-3-27 19:52 作者: 寬大 時間: 2025-3-27 22:52 作者: 填滿 時間: 2025-3-28 05:58 作者: 重畫只能放棄 時間: 2025-3-28 07:26
Surgical Treatment of Secondary Tremorive explicit examples to show that this bound is tight. We describe the connection this problem has to the problem of obtaining lower bounds on the number of ordinary points in arrangements of not all coincident, not all parallel lines, and show that there must be at least . such points.作者: 評論性 時間: 2025-3-28 14:08
Thomas Wichmann,Jerrold L. Viteke .-simplices that seem to be known for . ≥ 3 have .=. ., . ≥ 2. We prove, using eigenvalues, that there are no 2-reptile simplices of dimensions . ≥ 3. This investigation has been motivated by a probabilistic packet marking problem in theoretical computer science, introduced by Adler in 2002.作者: AMITY 時間: 2025-3-28 18:15
Amanda Norwich-Cavanaugh,Deepak Narayant contains three sets of . edges, such that every edge in any of the sets crosses all edges in the other two sets. Furthermore, two of the three sets can be chosen such that all . edges in the set have a common vertex.作者: CROAK 時間: 2025-3-28 19:06
https://doi.org/10.1007/11589440algorithm; algorithmic geometry; algorithms; approximation; combinatorial mathematics; computational geom作者: 顯示 時間: 2025-3-29 00:58 作者: Hearten 時間: 2025-3-29 05:19 作者: 短程旅游 時間: 2025-3-29 08:48 作者: exercise 時間: 2025-3-29 14:41 作者: Lipoprotein 時間: 2025-3-29 16:00 作者: 龍蝦 時間: 2025-3-29 22:12
The Lymphatic Spread of the Rectal Cancere generalized to the case where each point . ∈ . ∪ . is associated with a weight . .. A ham-sandwich cut can still be proved to exist, even if weights are allowed to be negative. In this paper, we present a .(. log .) algorithm to find a weighted ham-sandwich cut, but we show that deciding whether t作者: duplicate 時間: 2025-3-30 03:02 作者: 特征 時間: 2025-3-30 04:24 作者: Exterior 時間: 2025-3-30 10:18
Nam Kyu Kim,Kenichi Sugihara,Jin-Tung Liangectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex-unfolding using only such cuts.作者: motor-unit 時間: 2025-3-30 14:44
Rectourethral Prostatic Fistula,ex vertices inside the convex hull, the parameterized minimum number convex partition (MNCP) problem asks for a partition into a minimum number of convex pieces. We give a fixed-parameter tractable algorithm for this problem that runs in the following time complexities:.– linear time if . is constan作者: organism 時間: 2025-3-30 18:37
The Role of Liver Transplantationmum local convex partition?(MLCP) problem asks for two or three out of the .?edges that still partition . into convex pieces and that are of minimum total length. We present an optimal algorithm solving the problem in linear time if the edges incident to . are sorted clockwise by angle. For unsorted作者: 愛了嗎 時間: 2025-3-31 00:08
https://doi.org/10.1007/978-88-470-0729-1alent. This paper extends the result on edge-capacitated graphs, where the capacities are real numbers, and it presents a proof of the equivalence of the three relations. From this proof, it is also shown that we can determine whether or not a given graph precedes another given graph in polynomial t作者: 明確 時間: 2025-3-31 02:43 作者: Generic-Drug 時間: 2025-3-31 06:00
Alexander I. Tr?ster,Julie A. Fields make a . from any viewpoint even if these lines are in twisted position. In this context, the well-known Pappus’ theorem in . . is simply extended as that in . ., i.e., if the vertices of a spatial hexagon lie alternately on two lines, then from any viewpoint, three visual intersections of opposite作者: 圖畫文字 時間: 2025-3-31 09:17 作者: 沒有貧窮 時間: 2025-3-31 16:57 作者: 油膏 時間: 2025-3-31 20:41 作者: Vldl379 時間: 2025-3-31 22:08
Amanda Norwich-Cavanaugh,Deepak Narayant contains three sets of . edges, such that every edge in any of the sets crosses all edges in the other two sets. Furthermore, two of the three sets can be chosen such that all . edges in the set have a common vertex.作者: 淘氣 時間: 2025-4-1 04:31
Matching Points with Circles and Squares,o elements of .. If all of the elements of . belong to some . ., . is called a .; if in addition all the elements of . are pairwise disjoint we say that this matching . is .. In this paper we study the existence and properties of .-matchings for point sets in the plane when . is the set of circles o作者: concert 時間: 2025-4-1 06:39
