Axioms and hulls
From MaRDI portal
Publication:1202183
DOI10.1007/3-540-55611-7zbMath0777.68012OpenAlexW4235282062WikidataQ55951484 ScholiaQ55951484MaRDI QIDQ1202183
Publication date: 23 January 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55611-7
Delaunay triangulationsaxiomatic predicate systemdegeneracy removal techniquesparsimonious algorithmsuniform oriented matroidsvortex-free tournaments
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes, Topological art in simple galleries, Unnamed Item, Unnamed Item, A SAT attack on the Erdős-Szekeres conjecture, Static competitive facility location: an overview of optimisation approaches., Sweeps, arrangements and signotopes, On the Folkman-Lawrence topological representation theorem for oriented matroids of rank 3, An elementary algorithm for reporting intersections of red/blue curve segments, Enumeration of Gelfand-Cetlin type reduced words, Formalizing generalized maps in Coq, Every bit counts: The binary representation of typed data and programs, Enumeration, Counting, and Random Generation of Ladder Lotteries, Implementing Euclid's straightedge and compass constructions in type theory, The node visit cost of brother trees, Towards optimal parallel bucket sorting, Robustness and Randomness, Fringe analysis for extquick: An in situ distributive external sorting algorithm, Space saving generalization of \(B\)-trees with \(2/3\) utilization, An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings, Design and formal proof of a new optimal image segmentation program with hypermaps, Extreme point and halving edge search in abstract order types, The 2-page crossing number of \(K_{n}\), Exploiting few inversions when sorting: Sequential and parallel algorithms, A verified ODE solver and the Lorenz attractor, Permutation statistics and \((k,\ell)\)-hook Schur functions, The use and usefulness of numeration systems, On maximal weakly separated set-systems, Realization spaces of arrangements of convex bodies, LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies, On Delaunay oriented matroids for convex distance functions, Reconstructing Point Set Order Typesfrom Radial Orderings, Principal \(\Gamma\)-cone for a tree, Tiling-based models of perimeter and area, Enumerating topological \((n_k)\)-configurations, Reprint of: Extreme point and halving edge search in abstract order types, On the relationship between son-trees and symmetric binary B-trees, Data reduction for graph coloring problems, Formal specification and proofs for the topology and classification of combinatorial surfaces, Qualitative reasoning with directional relations, A note on some algorithms for matroids, On the number of simple arrangements of five double pseudolines, Condorcet domains of tiling type, Ham-sandwich cuts for abstract order types, q-hook length formulas for forests, Multitriangulations, pseudotriangulations and primitive sorting networks, XSAT and NAE-SAT of linear CNF classes, Designing and proving correct a convex hull algorithm with hypermaps in Coq, Coding and counting arrangements of pseudolines, Ramsey numbers and monotone colorings, A characterization of heaps and its applications, A note on some tree similarity measures, Two extensions of the Erdős-Szekeres problem, Cell complexes, oriented matroids and digital geometry., Reconstructing Point Set Order Types from Radial Orderings, Computer solution to the 17-point Erdős-Szekeres problem, Improved deterministic parallel integer sorting, A search problem on graphs which generalizes some group testing problems with two defectives, The method of creative telescoping, Factorizations in Schubert cells, Optimal reconfiguration of optimal ladder lotteries, Faradžev Read-type enumeration of non-isomorphic CC systems, Geodesic order types, An adaptive subdivision method for root finding of univariate polynomials, Three-dimensional convex hull as a fruitful source of diagrams, Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points, Optimal heapsort algorithm, Why is the 3D Delaunay triangulation difficult to construct?, Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof, Mahonian statistics on labeled forests, The ring of \(k\)-regular sequences, On unimodular tournaments, Enumeration of simple complete topological graphs, Unnamed Item, Plücker environments, wiring and tiling diagrams, and weakly separated set-systems, Efficient enumeration of all ladder lotteries and its application, Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\), New algorithms and bounds for halving pseudolines, Cambrian acyclic domains: counting \(c\)-singletons, A survey of techniques in applied computational complexity, Computing pseudotriangulations via branched coverings, On Some SAT-Variants over Linear Formulas, Induced Ramsey-type results and binary predicates for point sets, A combinatorial version of Sylvester's four-point problem, Arrangements of pseudocircles: on circularizability, Parallel hashing algorithms, Arrangements of pseudocircles: on circularizability, Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees, The expected linearity of a simple equivalence algorithm, Cycle action on treelike structures., Grassmannians and pseudosphere arrangements, Matricial characterization of tournaments with maximum number of diamonds, Multitriangulations as complexes of star polygons, Data Reduction for Graph Coloring Problems, Creating order in sequence spaces with simple machines, A scheme for constructing ordered minimal perfect hashing functions, On the computation of units and class numbers by a generalization of Lagrange's algorithm, A new measure of presortedness, The properties of random trees, Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees, The sorting order on a Coxeter group., Parking functions, valet functions and priority queues, Exact computation of the sign of a finite sum, Combining Isabelle and QEPCAD-B in the Prover’s Palette, Many order types on integer grids of polynomial size, Split sequence hash search, Swapping labeled tokens on graphs, Resurrecting the asymptotics of linear recurrences, THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS
