Results 121 to 130 of about 170,713 (161)
Some of the next articles are maybe not open access.
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1993
This correspondence presents a metric for describing line segments. This metric measures how well two line segments can be replaced by a single longer one. This depends for example on collinearity and nearness of the line segments. The metric is constructed using a new technique using so-called neighborhood functions. The behavior of the metric depends
openaire +1 more source
This correspondence presents a metric for describing line segments. This metric measures how well two line segments can be replaced by a single longer one. This depends for example on collinearity and nearness of the line segments. The metric is constructed using a new technique using so-called neighborhood functions. The behavior of the metric depends
openaire +1 more source
On Straight Line Segment Detection
Journal of Mathematical Imaging and Vision, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rafael Grompone von Gioi +3 more
openaire +2 more sources
INTERSECTIONS OF RANDOM LINE SEGMENTS
International Journal of Computational Geometry & Applications, 1994We consider a random collection of n line segments, in which the segments are independently drawn by picking the midpoint according to a given distribution in the plane, by picking a uniformly distributed random direction, and by adding an independently sampled segment length. We study the expected behavior of the number of intersections as a function
Luc Devroye, Binhai Zhu
openaire +2 more sources
A Problem of Guarding Line Segment
SIAM Journal on Control and Optimization, 2009Two games of guarding a line segment on the plane are considered. In the first one the line segment is guarded by one defender. One invader wants to pass through the line segment but he has to keep away from a capture region moving together with the defender.
openaire +3 more sources
Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Watchman Routes for Lines and Segments
2012Given a set $\mathcal L$ of non-parallel lines, a watchman route (tour) for $\mathcal L$ is a closed curve contained in the union of the lines in $\mathcal L$ such that every point on any line is visible (along a line) from at least one point of the route; similarly, we define a watchman route (tour) for a connected set $\mathcal S$ of line segments ...
Dumitrescu, Adrian +2 more
openaire +1 more source
Digital Straight Line Segments
IEEE Transactions on Computers, 1974It is shown that a digital arc S is the digitization of a straight line segment if and only if it has the "chord property:" the line segment joining any two points of S lies everywhere within distance 1 of S. This result is used to derive several regularity properties of digitizations of straight line segments.
openaire +1 more source
Weaving patterns of lines and line segments in space
Algorithmica, 1990A weaving \(W\) is a simple arrangement of lines (or line segments) in the plane together with a binary relation specifying which line is ``above'' the other. A system of lines (or line segments) in 3-space is called a realization of \(W\), if its projection into the plane is \(W\) and the ``above-below'' relations between the lines respect the ...
Pach, János +2 more
openaire +3 more sources
Expectancy of line segment orientation
Spatial Vision, 1996The question was asked whether briefly flashed line segments are easier to detect when presented at an expected, rather than an unexpected, orientation. Detection rates were measured in a two-interval forced choice (2IFC) paradigm that did not require the subject to identify the orientation of the line segment, only to detect its presence.
D D, Kurylo, A, Reeves, B, Scharf
openaire +2 more sources
Clustering of collinear line segments
Pattern Recognition, 1982Abstract A number of methods are presented for finding clusters in collinear collections of line segments. The methods are of two kinds — merging methods and splitting methods. Both make use of an evaluation function, and several alternative functions are illustrated.
Ann I. Scher +2 more
openaire +2 more sources