Results 11 to 20 of about 921,934 (330)
Output sensitive algorithms for covering many points [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Discrete Algorithms In this paper we devise some output sensitive algorithms for a problem where a set of points and a positive integer, m, are given and the goal is to cover a maximal number of these points with m disks. We introduce a parameter, ρ, as the maximum number of points that one disk can cover and we analyse the algorithms based ...
Hossein Ghasemalizadeh +1 more
doaj +5 more sources
Incremental Convex Hull Algorithms Are Not Output Sensitive [PDF]
Discrete & Computational Geometry, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Avis
openalex +4 more sources
AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES [PDF]
International Journal of Computational Geometry & Applications, 2013 We design an algorithm to compute the Newton polytope of the resultant, known as resultant polytope, or its orthogonal projection along a given direction. The resultant is fundamental in algebraic elimination, optimization, and geometric modeling. Our algorithm exactly computes vertex- and halfspace-representations of the polytope using an oracle ...
Ioannis Z. Emiris +3 more
+7 more sources
Output-sensitive algorithms for Tukey depth and related problems [PDF]
Statistics and Computing, 2008 The Tukey depth (Proceedings of the International Congress of Mathematicians, vol. 2, pp. 523---531, 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algorithms for computing the Tukey depth of a point in various dimensions are considered.
Bremner, David +4 more
openaire +2 more sources
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems
Journal of Computer and System Sciences, 2001 The author presents an output-sensitive randomized parallel algorithm for computing the rank of a matrix. An output-sensitive randomized parallel algorithm for finding a maximum linearly independent subset is also presented. Some combinatorial applications of this algorithm on maximum matchings in graphs are discussed.
J. Reif
openaire +3 more sources
The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive [PDF]
, 2019 The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, Löffler and Strash in "Listing all maximal cliques in ...
George Manoussakis
openalex +3 more sources
An output sensitive algorithm for discrete convex hulls [PDF]
Computational Geometry, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sariel Har-Peled
openalex +2 more sources
Optimal, output-sensitive algorithms for constructing planar hulls in parallel
Computational Geometry, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Neelima, Sen, Sandeep
openaire +3 more sources
An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices [PDF]
, 2008 This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise affine function that maps each feasible parameter to a solution of the associated LCP in such a way that the function ...
Sebastiano Columbano +2 more
openalex +4 more sources
An output-sensitive algorithm for computing projections of resultant polytopes [PDF]
Proceedings of the twenty-eighth annual symposium on Computational geometry, 2012 We develop an incremental algorithm to compute the Newton polytope of the resultant, aka resultant polytope, or its projection along a given direction. The resultant is fundamental in algebraic elimination and in implicitization of parametric hypersurfaces.
Emiris I.Z. +3 more
openaire +3 more sources