Algorithms in Combinatorial Geometry. By Herbert EdelsbrunnerWe classify nondegenerate plane configurations by attaching, to each such configuration of n points, a periodic sequence of permutations of {1, 2, …, n} which satisfies some simple conditions; this classification turns out to be ...
Algorithms in Combinatorial Geometry 作者: Herbert Edelsbrunner 出版社: Springer出版年: 1987-7-31页数: 423定价: GBP 117.00装帧: HardcoverISBN: 9783540137221豆瓣评分 评价人数不足 评价: 写笔记 写书评 加入购书单 分享到 推荐 我来说两句 短评 ··· 热门 还没人写过短评呢 我要写书评 Algorithms...
H. Edelsbrunner Algorithms in Combinatorial Geometry EATCS Monographs on Theoretical Computer Science, 10, Springer,, Berlin (1987), pp. 147-158 Google Scholar [18] K. Fukuda, cdd Reference Manual, Version 0.55 (EPFL, Lausanne, Switzerland). Google Scholar [19] K. Fukuda, mit71-61.ine solv...
Parallel computational geometry Algorithmica (1988) B Chazelle Computational geometry on a systolic chip IEEE Trans. Comput. (1984) R Cypher et al. Deterministic sorting in nearly logarithmic time on the hypercube and related computers H Edelsbrunner Algorithms in Combinatorial Geometry (1987) M Kumar...
Edelsbrunner, H.: Algorithms in combinatorial geometry. Springer, Berlin (1987) MATH Google Scholar Felsner, S.: Geometric Graphs and Arrangements. Vieweg, Wiesbaden (2004) Book MATH Google Scholar Fitch, W., Margoliash, E.: Construction of phylogenetic trees. Science 155, 279–284 (19...
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a point in...
Combinatorial Generation, Enumeration and Counting Combinatorial Optimization Complexity Theory Combinatorics of Words Computational Algebra and Geometry Computational Biology Cryptography and Information Security Distributed and Parallel Algorithms Experimental Evaluation of Algorithms Fine-grained Complexity...
combinatorial model ofunique sink orientationswhose rich structure has recently received considerable attention. One consequence is that Welzl's algorithmdoeswork for small instances; moreover, there is a variety ofpivotingmethods for unique sink orientations which have the potential of being fast in ...
Algorithm engineering Algorithmic aspects of networks Algorithmic game theory Algorithmic Data Science Approximation algorithms Computational biology Computational finance Computational geometry Combinatorial optimization Data compression Data structures Databases and information retrieval Distributed and parallel computing ...
The 36th International Workshop on Combinatorial Algorithms (IWOCA 2025) will be held during July 21-24, 2025, in Bozeman, MT, USA. (Bozeman is 90 miles away from Yellowstone National Park, and late July is probably the best time to visit Yellowstone.) ...