標題: Titlebook: Computational Geometry; XIV Spanish Meeting Alberto Márquez,Pedro Ramos,Jorge Urrutia Book 2012 Springer-Verlag Berlin Heidelberg 2012 com [打印本頁] 作者: 母牛膽小鬼 時間: 2025-3-21 17:02
書目名稱Computational Geometry影響因子(影響力)
書目名稱Computational Geometry影響因子(影響力)學科排名
書目名稱Computational Geometry網(wǎng)絡公開度
書目名稱Computational Geometry網(wǎng)絡公開度學科排名
書目名稱Computational Geometry被引頻次
書目名稱Computational Geometry被引頻次學科排名
書目名稱Computational Geometry年度引用
書目名稱Computational Geometry年度引用學科排名
書目名稱Computational Geometry讀者反饋
書目名稱Computational Geometry讀者反饋學科排名
作者: diathermy 時間: 2025-3-21 20:50 作者: left-ventricle 時間: 2025-3-22 04:29
Tangled Thrackles,gency. If we allow a third option: the common point may be a proper crossing between the two edges, then the graph is called a .. We establish the following analogues of Conway’s thrackle conjecture: The number of edges of a tangle cannot exceed its number of vertices, .. We also prove that the numb作者: Offensive 時間: 2025-3-22 08:24 作者: gastritis 時間: 2025-3-22 08:43 作者: 網(wǎng)絡添麻煩 時間: 2025-3-22 14:18 作者: 網(wǎng)絡添麻煩 時間: 2025-3-22 17:55 作者: 生來 時間: 2025-3-23 01:07
Convexifying Monotone Polygons while Maintaining Internal Visibility, paper we study the following questions posed in?[8,9]: (1) Is it true that every non-convex simple polygon has a vertex that can be continuously moved such that during the process no vertex-vertex visibility is lost and some vertex-vertex visibility is gained? (2) Can every simple polygon be convex作者: 臭名昭著 時間: 2025-3-23 03:12
On the Number of Radial Orderings of Colored Planar Point Sets,n general position. A . of . with respect to . is a circular ordering of the elements of . by angle around .. A . is a radial ordering of . in which only the colors of the points are considered. We show that: the number of distinct radial orderings of . is at most .(.) and at least Ω(.); the number 作者: 逢迎白雪 時間: 2025-3-23 08:02
Locating a Service Facility and a Rapid Transit Line,ly located in order to minimize the total travel time of the clients to the facility, using the . or Manhattan metric. The rapid transit line is represented by a line segment with fixed length and arbitrary orientation. The highway is an alternative transportation system that can be used by the clie作者: Adenoma 時間: 2025-3-23 11:53
Simultaneously Flippable Edges in Triangulations,s . if each edge is flippable and no two edges are adjacent to a common triangle. Intuitively, an edge is flippable if it may be replaced with the other diagonal of its quadrilateral without creating edge-edge intersections, and a set of edges is simultaneously flippable if they may be all be flippe作者: 蜿蜒而流 時間: 2025-3-23 16:10 作者: ineluctable 時間: 2025-3-23 21:27
Compact Grid Representation of Graphs, but the extremes. Additionally . is said to be . if it is grid locatable and the segments representing edges do not cross each other. We study the area needed to obtain those representations for some graph families.作者: Gratulate 時間: 2025-3-24 00:49
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on W)????>?.(.). The weight of a subsequence of ., is the sum of its elements. In this paper, we prove that any permutation of {1, …, .} contains an increasing or a decreasing subsequence of weight greater than ...Our motivation to study the previous pro作者: habitat 時間: 2025-3-24 06:01 作者: 關節(jié)炎 時間: 2025-3-24 08:11
Studies in Risk and Uncertainty in such a way that no face of the dissection of . includes any part of an edge of ., no face of the dissection of . includes any part of an edge of ., the pieces are hinged on some of their edges so that the pieces of the dissection are connected as in a tree-structure, all of the exterior surface 作者: 責任 時間: 2025-3-24 12:14 作者: ENACT 時間: 2025-3-24 15:24
Almost Stochastic Dominance (ASD),closed edge guards, using open edge guards. A . of a polygon is an edge that sees every point inside the polygon. We show that every simple non-starshaped polygon admits at most one open guard edge, and give a simple new proof that it admits at most three closed guard edges. We also characterize ope作者: nocturia 時間: 2025-3-24 22:47 作者: 能量守恒 時間: 2025-3-24 23:54
Stochastic Dominance Decision Rules,ints in ., where disjoint segments are adjacent. The chromatic number of this graph was first studied by Araujo?et?al.?[., 2005]. The previous best bounds are . (ignoring lower order terms). In this paper we improve the lower bound to ., achieving near-tight bounds on .(.).作者: 欲望小妹 時間: 2025-3-25 05:20 作者: judicial 時間: 2025-3-25 11:20 作者: Defense 時間: 2025-3-25 15:24 作者: diathermy 時間: 2025-3-25 18:20
Stochastic Dominance: Introduction,ly located in order to minimize the total travel time of the clients to the facility, using the . or Manhattan metric. The rapid transit line is represented by a line segment with fixed length and arbitrary orientation. The highway is an alternative transportation system that can be used by the clie作者: consolidate 時間: 2025-3-25 23:31
The Linear Dynamic Econometric Model,s . if each edge is flippable and no two edges are adjacent to a common triangle. Intuitively, an edge is flippable if it may be replaced with the other diagonal of its quadrilateral without creating edge-edge intersections, and a set of edges is simultaneously flippable if they may be all be flippe作者: 狂熱文化 時間: 2025-3-26 01:26
Performance Seismic Safety Evaluation, line (highway) . that together minimize the expression max .(.,.), where .(.,.) is the travel time between . and .. A point .?∈?. uses . to reach . if . saves time for .. We solve the problem in .(.) or .(.log.) time, depending on whether or not the highway’s length is fixed.作者: 幻想 時間: 2025-3-26 07:45 作者: 是貪求 時間: 2025-3-26 08:40 作者: 壕溝 時間: 2025-3-26 14:23
Alberto Márquez,Pedro Ramos,Jorge UrrutiaHigh quality selected papers.Unique visibility.State of the art research作者: 群島 時間: 2025-3-26 17:09 作者: Adornment 時間: 2025-3-26 22:42
Stochastic Dominance and Diversification,Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert one into the other? This question has occupied researchers for over 75 years. We provide a comprehensive survey, including full proofs, of the various attempts to answer it.作者: 青石板 時間: 2025-3-27 04:09
Stochastic Dominance Option PricingThe twisted graph . is a complete topological graph with . vertices .,.,…,. in which two edges . (.?
作者: Condyle 時間: 2025-3-27 07:01
https://doi.org/10.1007/978-3-642-95379-8We introduce a simple algorithm for constructing a spiral serpentine polygonization of a set . of .?≥?3 points in the plane. Our algorithm simultaneously gives a triangulation of the constructed polygon at no extra cost, runs in .(. log.) time, and uses .(.) space.作者: 護身符 時間: 2025-3-27 10:31
Vadim S. Anishchenko,Alexander B. NeimanWe present a new method for unfolding a convex polyhedron into one piece without overlap, based on shortest paths to a convex curve on the polyhedron. Our “sun unfoldings” encompass source unfolding from a point, source unfolding from an open geodesic curve, and a variant of a recent method of Itoh, O’Rourke, and V?lcu.作者: Epithelium 時間: 2025-3-27 14:37
https://doi.org/10.1007/BFb0105592This paper describes algorithms for computing non-planar drawings of planar graphs in subquadratic area such that: (i) edge crossings are allowed only if they create large angles; (ii) the maximum number of bends per edge is bounded by a (small) constant.作者: 強壯 時間: 2025-3-27 20:58 作者: 高深莫測 時間: 2025-3-27 23:31
Notes on the Twisted Graph,The twisted graph . is a complete topological graph with . vertices .,.,…,. in which two edges . (.?
作者: APRON 時間: 2025-3-28 04:04
Spiral Serpentine Polygonization of a Planar Point Set,We introduce a simple algorithm for constructing a spiral serpentine polygonization of a set . of .?≥?3 points in the plane. Our algorithm simultaneously gives a triangulation of the constructed polygon at no extra cost, runs in .(. log.) time, and uses .(.) space.作者: 乳白光 時間: 2025-3-28 06:52 作者: Tonometry 時間: 2025-3-28 13:44 作者: 翅膀拍動 時間: 2025-3-28 18:11 作者: 與野獸博斗者 時間: 2025-3-28 19:28 作者: 使困惑 時間: 2025-3-28 23:53
The Chromatic Number of the Convex Segment Disjointness Graph,ints in ., where disjoint segments are adjacent. The chromatic number of this graph was first studied by Araujo?et?al.?[., 2005]. The previous best bounds are . (ignoring lower order terms). In this paper we improve the lower bound to ., achieving near-tight bounds on .(.).作者: 改進 時間: 2025-3-29 06:45 作者: jovial 時間: 2025-3-29 08:32 作者: 主動 時間: 2025-3-29 13:33 作者: FAR 時間: 2025-3-29 17:24
Computational Geometry978-3-642-34191-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 貧窮地活 時間: 2025-3-29 21:19
Stochastic Dominance Decision Rules,ints in ., where disjoint segments are adjacent. The chromatic number of this graph was first studied by Araujo?et?al.?[., 2005]. The previous best bounds are . (ignoring lower order terms). In this paper we improve the lower bound to ., achieving near-tight bounds on .(.).作者: 商店街 時間: 2025-3-30 01:22 作者: 變化 時間: 2025-3-30 05:42 作者: 東西 時間: 2025-3-30 08:31 作者: Lament 時間: 2025-3-30 12:35 作者: FLINT 時間: 2025-3-30 16:52 作者: invert 時間: 2025-3-30 20:41
Random Loads Acting on Marine Structures,ermining lower bounds on the weight of the heaviest increasing path a point set always has..We also study the problem of finding a non-crossing matching of the elements of . of maximum weight, where the weight of an edge with endpoints ., .?∈?. is min{.,.}.作者: 高度 時間: 2025-3-31 01:36 作者: effrontery 時間: 2025-3-31 05:52
0302-9743 he occasion of his 60th birthday; it contains extended versions of selected communications presented at the XIV Spanish Meeting on Computational Geometry, held at the University of Alcalá, Spain, in June 2011. .Ferran Hurtado has played a central role in the Spanish community of Computational Geomet作者: fidelity 時間: 2025-3-31 10:39
Studies in Risk and Uncertaintyrossing number, provide an improved lower bound for the number of convex 5-holes any point set must contain, and prove that the number of general 5-holes is asymptotically maximized for point sets in convex position.作者: occult 時間: 2025-3-31 17:18
Applications of Stochastic Dominance Rules, string is taut and circulates, it rotates by friction all the ⊕-disks counterclockwise and all the ?-disks clockwise, without any string-rubbing conflicts. We show that although this is not always possible, natural disk-separation conditions guarantee a solution. We also characterize the hexagonal “penny-packing” arrangements that are wrappable.作者: negotiable 時間: 2025-3-31 19:24
Stochastic Dominance: The Quantile,nly the colors of the points are considered. We show that: the number of distinct radial orderings of . is at most .(.) and at least Ω(.); the number of colored radial orderings of . is at most .(.) and at least Ω(.); there exists sets of points with Θ(.) colored radial orderings and sets of points with only .(.) colored radial orderings.作者: Glossy 時間: 2025-4-1 00:24
On 5-Gons and 5-Holes,rossing number, provide an improved lower bound for the number of convex 5-holes any point set must contain, and prove that the number of general 5-holes is asymptotically maximized for point sets in convex position.作者: 車床 時間: 2025-4-1 05:47 作者: chemical-peel 時間: 2025-4-1 08:29 作者: inveigh 時間: 2025-4-1 13:28
