Output-sensitive algorithm

Known as: Output sensitivity, Output-sensitivity 
In computer science, an output-sensitive algorithm is an algorithm whose running time depends on the size of the output, instead of, or in addition… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Reactive synthesis is a technology for the automatic construction of reactive systems from logical specifications. In these… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
We develop an incremental algorithm to compute the Newton polytope of the resultant, aka resultant polytope, or its projection… (More)
Is this relevant?
2011
2011
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed up the computation of the… (More)
Is this relevant?
2009
2009
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
The β-skeleton is a measure of the internal shape of a planar set of points. We get an entire spectrum of shapes by varying the… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present simple output-sensitive algorithms that construct the convex hull of a set ofn points in two or three dimensions in… (More)
  • figure 1
Is this relevant?
1993
1993
Given a set of polyhedra and a polygon in E3, the –aspect graph is a partition of the faces of the polyhedra into regions such… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
We derive a simple output-sensitive algorithm for hidden surfaceremoval in a collection of <?Pub Fmt italic>n<?Pub Fmt /italic… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertex set… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?