標(biāo)題: Titlebook: Computational Geometry - Methods, Algorithms and Applications; International Worksh H. Bieri,H. Noltemeier Conference proceedings 1991 Spri [打印本頁] 作者: Orthosis 時間: 2025-3-21 19:06
書目名稱Computational Geometry - Methods, Algorithms and Applications影響因子(影響力)
書目名稱Computational Geometry - Methods, Algorithms and Applications影響因子(影響力)學(xué)科排名
書目名稱Computational Geometry - Methods, Algorithms and Applications網(wǎng)絡(luò)公開度
書目名稱Computational Geometry - Methods, Algorithms and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Geometry - Methods, Algorithms and Applications被引頻次
書目名稱Computational Geometry - Methods, Algorithms and Applications被引頻次學(xué)科排名
書目名稱Computational Geometry - Methods, Algorithms and Applications年度引用
書目名稱Computational Geometry - Methods, Algorithms and Applications年度引用學(xué)科排名
書目名稱Computational Geometry - Methods, Algorithms and Applications讀者反饋
書目名稱Computational Geometry - Methods, Algorithms and Applications讀者反饋學(xué)科排名
作者: Hot-Flash 時間: 2025-3-21 21:43 作者: Intractable 時間: 2025-3-22 03:12
Sample-Path-Based Policy Iterationing isothetic rectangles. We propose an .(n log .) time algorithm for finding, given a set . of . isothetic rectangles, a pair of isothetic rectangles (.) such that . and . enclose all rectangles of . and area(s) + area(t) is minimal. Moreover we prove an .(n log .) lower bound for the one-dimensional version of the problem.作者: Laconic 時間: 2025-3-22 05:27
https://doi.org/10.1007/978-3-030-48306-7omputing the geodesic diameter and the link diameter for a polygon..We consider the rectilinear case of this problem and give a linear time algorithm to compute the rectilinear link diameter of a simple rectilinear polygon. To our knowledge this is the first optimal algorithm for the diameter problem of non-trivial classes of polygons.作者: flimsy 時間: 2025-3-22 09:30 作者: 高調(diào) 時間: 2025-3-22 14:48 作者: 高調(diào) 時間: 2025-3-22 19:12 作者: 節(jié)省 時間: 2025-3-22 21:25 作者: compel 時間: 2025-3-23 04:24 作者: gnarled 時間: 2025-3-23 05:48 作者: 搜尋 時間: 2025-3-23 12:05 作者: 鞏固 時間: 2025-3-23 17:43
Sample-Path-Based Policy Iterationing isothetic rectangles. We propose an .(n log .) time algorithm for finding, given a set . of . isothetic rectangles, a pair of isothetic rectangles (.) such that . and . enclose all rectangles of . and area(s) + area(t) is minimal. Moreover we prove an .(n log .) lower bound for the one-dimension作者: 膽小懦夫 時間: 2025-3-23 21:51
Stochastic Learning and Optimizationplane which never meets ≥2 event points at the same time. . is an on-line algorithm which ensures that the regular position of the sweep plane is never destroyed by a new event point created during the sweep. If necessary, it dynamically replaces the actual sweep plane by a more suitable one, but al作者: 舊石器時代 時間: 2025-3-23 23:10
https://doi.org/10.1007/978-3-642-66252-2 [Ballard 1981], a curvefitting approach using Bezier curves [Bezier 1974, Pavlidis 1982], and the arc tree [Günther 1988, Günther and Wong 1989]. Each of these schemes represents a curved shape as a hierarchy of approximations, where higher levels in the hierarchy correspond to coarser approximatio作者: 使成整體 時間: 2025-3-24 04:50 作者: myalgia 時間: 2025-3-24 06:57 作者: 擴大 時間: 2025-3-24 10:41
https://doi.org/10.1007/b105472a given network optimization problem, such as finding a minimum spanning tree or finding a minimum diameter spanning tree, we study the problem of choosing a subset . of . that contains at least one point of each class and solving the network optimization problem for ., such that the solution is opt作者: 極大的痛苦 時間: 2025-3-24 15:23
https://doi.org/10.1007/b105472ere . represents the number of edges of the object. Our algorithm is an extension of Weinberg‘s algorithm for determining isomorphisms of planar triply connected graphs. The symmetry information detected by our algorithm can be utilized for various purposes in artificial intelligence, robotics, asse作者: obeisance 時間: 2025-3-24 21:53
https://doi.org/10.1007/b105472bot with on-board vision system we describe a strategy for finding a short path from . to . in a street not known in advance, and prove that the length of the path created does not exceed 1+3/2. times the length of the shortest path from . to .. Experiments suggest that our strategy is much better t作者: PALMY 時間: 2025-3-25 03:05
https://doi.org/10.1007/b105472spect to some other objects. In view of this information, the problem to be addressed is how to draw conclusions about the position of a particular object . with respect to another object .. An adaptation of the well known mathematical theory of evidence called theory of hints will be used for the r作者: PALMY 時間: 2025-3-25 04:26 作者: 獸群 時間: 2025-3-25 09:28
https://doi.org/10.1007/978-3-030-48306-7tation of production-quality library programs. This paper introduces the components of this programming environment and gives some implementation details. The system is implemented in an object oriented extension of Pascal on the Apple Macintosh computer. We report our experience with object oriente作者: Isthmus 時間: 2025-3-25 13:24 作者: NAUT 時間: 2025-3-25 18:07
https://doi.org/10.1007/978-3-030-20922-3more computational geometry and knowledge engineering point of view. This includes the representation of proximity properties as well as applications in the layout of assembly lines, in machine layout and in robot vision/ motion planning problems. Some recent results on monotonous bisector trees are作者: 把手 時間: 2025-3-25 23:48
https://doi.org/10.1007/978-3-030-20922-3fine a Voronoi diagram which also changes continuously, except for certain critical instances — so-called ...In [Ro 90], an efficient method is presented of . the Voronoi diagram over time. Recently Guibas, Mitchell and Roos [GuMiRo 91] improved the trivial quartic upper bound on the number of topol作者: 生命層 時間: 2025-3-26 01:13 作者: 放棄 時間: 2025-3-26 05:41 作者: debble 時間: 2025-3-26 08:58 作者: 進入 時間: 2025-3-26 15:54
An optimal algorithm for approximating a set of rectangles by two minimum area rectangles,ing isothetic rectangles. We propose an .(n log .) time algorithm for finding, given a set . of . isothetic rectangles, a pair of isothetic rectangles (.) such that . and . enclose all rectangles of . and area(s) + area(t) is minimal. Moreover we prove an .(n log .) lower bound for the one-dimensional version of the problem.作者: 拋射物 時間: 2025-3-26 19:55
Computing the rectilinear link diameter of a polygon,omputing the geodesic diameter and the link diameter for a polygon..We consider the rectilinear case of this problem and give a linear time algorithm to compute the rectilinear link diameter of a simple rectilinear polygon. To our knowledge this is the first optimal algorithm for the diameter problem of non-trivial classes of polygons.作者: FADE 時間: 2025-3-26 21:15
https://doi.org/10.1007/3-540-54891-2Performance; algorithm; algorithms; artificial intelligence; complexity; computational geometry; intellige作者: euphoria 時間: 2025-3-27 02:18 作者: 網(wǎng)絡(luò)添麻煩 時間: 2025-3-27 05:16 作者: 狗舍 時間: 2025-3-27 10:37 作者: Notify 時間: 2025-3-27 15:06
An on-line algorithm for constructing sweep planes in regular position,plane which never meets ≥2 event points at the same time. . is an on-line algorithm which ensures that the regular position of the sweep plane is never destroyed by a new event point created during the sweep. If necessary, it dynamically replaces the actual sweep plane by a more suitable one, but al作者: 身體萌芽 時間: 2025-3-27 20:29 作者: AUGUR 時間: 2025-3-28 00:34
Preclassification and delayed classification of boundary entities in arbitrary dimensions,is preclassification is related to the convex hull on a sphere. This allows an unified approach for very general polyhedra of arbitrary dimensions and for all boundary entities (vertices, edges, faces). It also reduces the time complexity of preclassification in 3D. Replacing preclassification by de作者: 商品 時間: 2025-3-28 05:16 作者: Invigorate 時間: 2025-3-28 08:53 作者: 高腳酒杯 時間: 2025-3-28 13:29
Determination of the symmetries of polyhedra and an application to object recognition,ere . represents the number of edges of the object. Our algorithm is an extension of Weinberg‘s algorithm for determining isomorphisms of planar triply connected graphs. The symmetry information detected by our algorithm can be utilized for various purposes in artificial intelligence, robotics, asse作者: 美麗的寫 時間: 2025-3-28 18:07 作者: Ganglion-Cyst 時間: 2025-3-28 21:14 作者: FUSE 時間: 2025-3-29 00:42
,Solving algebraic systems in Bernstein-Bézier representation,n of the coefficients. It is shown how this so-called Bézier representation can be used for the calculation of the solution manifold of algebraic systems. In this contribution, the manifold is represented by a hierarchy of cuts describing its complete topology. The location of the cuts is calculated作者: Obvious 時間: 2025-3-29 03:23 作者: scrutiny 時間: 2025-3-29 07:55 作者: Aerate 時間: 2025-3-29 15:05
,Layout of flexible manufacturing systems — selected problems,more computational geometry and knowledge engineering point of view. This includes the representation of proximity properties as well as applications in the layout of assembly lines, in machine layout and in robot vision/ motion planning problems. Some recent results on monotonous bisector trees are作者: NEEDY 時間: 2025-3-29 18:18 作者: DOSE 時間: 2025-3-29 19:51 作者: 允許 時間: 2025-3-30 00:40
Conference proceedings 1991 March 21/22,1991.Computational geometry is not a precisely defined field.Often, it is understood as a nearly mathematical discipline,dealing mainly with complexity questionsconcerninggeometrical problems and algorithms. But often too,andperhaps increasingly, questions of more practical relevanceare作者: 我說不重要 時間: 2025-3-30 06:38
https://doi.org/10.1007/978-3-642-66252-2ns of the curve. The schemes are compared on several geometric operations including point inclusion, curve-curve intersection, curve-area intersection, and area-area intersection. It is shown that in most cases the arc tree is the most efficient representation scheme of the three evaluated.作者: 截斷 時間: 2025-3-30 09:07
https://doi.org/10.1007/978-1-4419-7729-8ot necessarily preserve all the properties of linear objects because it uses a curved model to approximate linear object. Both methods are implemented and applied for 3D Boolean operations on polyhedra.作者: addict 時間: 2025-3-30 15:59 作者: MEEK 時間: 2025-3-30 17:20 作者: Pelago 時間: 2025-3-30 23:23
Chance Constrained Programming, for all boundary entities (vertices, edges, faces). It also reduces the time complexity of preclassification in 3D. Replacing preclassification by delayed classification leads to an additional reduction of time complexity.作者: 圓錐 時間: 2025-3-31 01:47
https://doi.org/10.1007/b105472y connected graphs. The symmetry information detected by our algorithm can be utilized for various purposes in artificial intelligence, robotics, assembly planning and machine vision. In particular, an application of symmetry analysis to object recognition will be described in some detail.作者: 笨拙的你 時間: 2025-3-31 06:25 作者: 闡明 時間: 2025-3-31 12:40
https://doi.org/10.1007/b105472ems. In this contribution, the manifold is represented by a hierarchy of cuts describing its complete topology. The location of the cuts is calculated by iterated subdivision excluding non-relevant partition elements by using the convex hull property of the Bézier representation.作者: somnambulism 時間: 2025-3-31 15:31 作者: Herbivorous 時間: 2025-3-31 18:01 作者: 蒙太奇 時間: 2025-4-1 01:16 作者: 軍械庫 時間: 2025-4-1 01:51
Preclassification and delayed classification of boundary entities in arbitrary dimensions, for all boundary entities (vertices, edges, faces). It also reduces the time complexity of preclassification in 3D. Replacing preclassification by delayed classification leads to an additional reduction of time complexity.作者: CHURL 時間: 2025-4-1 10:00 作者: chemical-peel 時間: 2025-4-1 10:24 作者: IRATE 時間: 2025-4-1 17:44
,Solving algebraic systems in Bernstein-Bézier representation,ems. In this contribution, the manifold is represented by a hierarchy of cuts describing its complete topology. The location of the cuts is calculated by iterated subdivision excluding non-relevant partition elements by using the convex hull property of the Bézier representation.作者: Eviction 時間: 2025-4-1 18:34
