Results 21 to 30 of about 921,934 (330)
A simple output-sensitive algorithm for hidden surface removal [PDF]
ACM Transactions on Graphics, 1992 We derive a simple output-sensitive algorithm for hidden surface removal in a collection of n triangles in space for which a (partial) depth order is known. If k is the combinatorial complexity of the output visibility map , the method runs in time O(n √k log n).
Micha Sharir, Mark H. Overmars
openalex +4 more sources
An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers [PDF]
, 2019 String covers are a powerful tool for analyzing the quasi-periodicity of 1-dimensional data and find applications in automata theory, computational biology, coding and the analysis of transactional data. A \emph{cover} of a string $T$ is a string $C$ for which every letter of $T$ lies within some occurrence of $C$.
Alexandru Popa, Andrei Tănăsescu
openalex +4 more sources
An Output-Sensitive Convex Hull Algorithm for Planar Objects
International Journal of Computational Geometry & Applications, 1998 A set of planar objects is said to be of type m if the convex hull of any two objects has its size bounded by 2m. In this paper, we present an algorithm based on the marriage-before-conquest paradigm to compute the convex hull of a set of n planar convex objects of fixed type m. The algorithm is output-sensitive, i.e.
Nielsen, Franck, Yvinec, Mariette
openaire +3 more sources
Output-sensitive modular algorithms for polynomial matrix normal forms
Journal of Symbolic Computation, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Howard, Labahn, George
openaire +2 more sources
Output-sensitive algorithm for generating the flats of a matroid [PDF]
, 2011 We present an output-sensitive algorithm for generating the whole set of flats of a finite matroid. Given a procedure, P, that decides in S_P time steps if a set is independent, the time complexity of the algorithm is O(N^2 M S_P), where N and M are the input and output size, respectively.
A. Montina
openalex +3 more sources
Output-sensitive Skyline Algorithms in External Memory [PDF]
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 Xiaocheng Hu +4 more
openaire +2 more sources
Output-sensitive algorithms for enumeration problems in graphs
, 2019 Cette thèse est une étude, d’un point de vue algorithmique, de la complexité de la résolution de certains problèmes d’énumération dans les graphes. Les algorithmes pour les problèmes d’énumération ont pour but la production de toutes les solutions d’un problème combinatoire, et ce sans répétition.
Sarah Blind
openalex +3 more sources
, 2019 This report documents the program and the outcomes of Dagstuhl Seminar 18421 "Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative". Enumeration problems require to list all wanted objects of the input as, e.g., particular subsets of the vertex or edge set of a given graph or particular satisfying assignments of ...
Henning Fernau +2 more
openalex +4 more sources
09171 Executive Summary – Adaptive, Output Sensitive, Online and Parameterized Algorithms
, 2009 Traditionally the analysis of algorithms measures the complexity of a problem or algorithm in terms of the worst-case behavior over all inputs of a given size. However, in certain cases an improved algorithm can be obtained by considering a finer partition of the input space.
Jérémy Barbay +3 more
openalex +4 more sources
An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs
, 2018 The degeneracy of a graph G is the smallest integer k such that every subgraph of G contains a vertex of degree at most k. Given an n-order k-degenerate graph G, we present an algorithm for enumerating all its maximal cliques. Assuming that c is the number of maximal cliques of G, our algorithm has setup time O(n(k^2+s(k+1))) and enumeration time cO((k+
George Manoussakis
openalex +5 more sources