POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION

2000 ◽  
Vol 10 (02) ◽  
pp. 189-200 ◽  
Author(s):  
S. K. WISMATH
Keyword(s):  
Polynomial Time ◽  
Line Segment ◽  
Related Problem ◽  
Parallel Line ◽  
Visibility Graph ◽  
Reconstruction Problem ◽  
System Of Linear Inequalities ◽  
Line Segments ◽  
Definition Of ◽  
Set Of Points

In general, visibility reconstruction problems involve determining a set of objects in the plane that exhibit a specified set of visibility constraints. In this paper, an algorithm is presented for reconstructing a set of parallel line segments from specified visibility information contained in an extended endpoint visibility graph. The algorithm runs in polynomial time and relies on simple vector arithmetic to generate a system of linear inequalities. A related problem, solvable with the same technique, is the point reconstruction problem, in which the cyclic ordering and the x-coordinates of a set of points is specified. A second contribution is the definition of an extension of the visibility graph called the Stab Graph, which contains extra visibility information.

Poggendorff Illusion as a Function of Orientation of Transversal and Parallel Lines

1976 ◽  
Vol 43 (1) ◽  
pp. 83-90 ◽  
Author(s):  
Barry S. Anton
Keyword(s):  
Visual Acuity ◽  
Line Segment ◽  
Poggendorff Illusion ◽  
Human Subjects ◽  
Parallel Line ◽  
Normal Vision ◽  
Transversal Line ◽  
Line Segments ◽  
Adult Human ◽  
Parallel Lines

Adult human subjects (8 male, 8 female undergraduates) with normal vision were required to judge various orientations of the Poggendorff illusion. The transversal and parallel line-segments of the illusion were manipulated to produce the orientations to be judged. Minimum illusion occurred when the transversal line-segment was oriented 90° with respect to true vertical or true horizontal. Magnitude of illusion increased as the transversal line-segment deviated from these positions. The findings suggested that there is a stability of horizontal and vertical orientations. In addition, the hypothesis that visual acuity plays a role in the perception of the Poggendorff illusion was proposed.

MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS

1995 ◽  
Vol 05 (03) ◽  
pp. 243-256 ◽  
Author(s):  
DAVID RAPPAPORT
Keyword(s):  
Convex Hull ◽  
General Problem ◽  
Line Segment ◽  
Simple Polygon ◽  
Fixed Number ◽  
Line Segments ◽  
Geometric Objects ◽  
Finite Set ◽  
Minimum Perimeter ◽  
Set Of Points

Let S be used to denote a finite set of planar geometric objects. Define a polygon transversal of S as a closed simple polygon that simultaneously intersects every object in S, and a minimum polygon transversal of S as a polygon transversal of S with minimum perimeter. If S is a set of points then the minimum polygon transversal of S is the convex hull of S. However, when the objects in S have some dimension then the minimum polygon transversal and the convex hull may no longer coincide. We consider the case where S is a set of line segments. If the line segments are constrained to lie in a fixed number of orientations we show that a minimum polygon transversal can be found in O(n log n) time. More explicitely, if m denotes the number of line segment orientations, then the complexity of the algorithm is given by O(3mn+log n). The general problem for line segments is not known to be polynomial nor is it known to be NP-hard.

Less is more: Simple stimuli provoke more variable search strategies.

2020 ◽  
Author(s):  
Anna Nowakowska ◽  
Alasdair D F Clarke ◽  
Jessica Christie ◽  
Josephine Reuther ◽  
Amelia R. Hunt
Keyword(s):  
Line Segment ◽  
Search Strategies ◽  
Complex Objects ◽  
Search Behaviour ◽  
Line Segments ◽  
Surface Level ◽  
Efficient Search ◽  
Less Is More ◽  
Dramatic Shift

We measured the efficiency of 30 participants as they searched through simple line segment stimuli and through a set of complex icons. We observed a dramatic shift from highly variable, and mostly inefficient, strategies with the line segments, to uniformly efficient search behaviour with the icons. These results demonstrate that changing what may initially appear to be irrelevant, surface-level details of the task can lead to large changes in measured behaviour, and that visual primitives are not always representative of more complex objects.

Explanation for Neon Color Effect in Achromatic Line Segments on Chromatic Inducers Based on the Multiple Interpretation Hypothesis

2005 ◽  
Vol 101 (1) ◽  
pp. 267-282
Author(s):  
Seiyu Sohmiya
Keyword(s):  
Visual System ◽  
Line Segment ◽  
Color Contrast ◽  
Achromatic Color ◽  
Line Segments ◽  
Color Effect ◽  
Complementary Color ◽  
Multiple Interpretation ◽  
Color Induction ◽  
Simultaneous Color Contrast

In van Tuijl's neon configurations, an achromatic line segment on a blue inducer produces yellowish illusory color in the illusory area. This illusion has been explained based on the idea of the complementary color induced by the blue inducer. However, it is proposed here that this illusion can be also explained by introducing the assumption that the visual system unconsciously interprets an achromatic color as information that is constituted by transparent and nontransparent colors. If this explanation is correct, not only this illusion, but also the simultaneous color contrast illusion can be explained without using the idea of the complementary color induction.

ALPHA-REGULAR STICK UNKNOTS

2012 ◽  
Vol 21 (06) ◽  
pp. 1250059 ◽  
Author(s):  
CHRISTOPHER FRAYER ◽  
CHRISTOPHER SCHAFHAUSER
Keyword(s):  
Line Segment ◽  
Line Segments

Suppose Pn is a regular n-gon in ℝ2. An embedding f : Pn ↪ ℝ3 is called an α-regular stick knot provided the image of each side of Pn under f is a line segment of length 1 and any two consecutive line segments meet at an angle of α. The main result of this paper proves the existence of α-regular stick unknots for odd n ≥ 7 with α in the range [Formula: see text]. All knots constructed will have trivial knot type, and we will show that any non-trivial α-regular stick knot must have [Formula: see text].

BASELINE BOUNDED HALF-PLANE VORONOI DIAGRAM

2013 ◽  
Vol 05 (03) ◽  
pp. 1350021 ◽  
Author(s):  
BING SU ◽  
YINFENG XU ◽  
BINHAI ZHU
Keyword(s):  
Voronoi Diagram ◽  
Half Plane ◽  
Line Segment ◽  
Euclidean Plane ◽  
Voronoi Region ◽  
Point Set ◽  
Set Of Points

Given a set of points P = {p1, p2, …, pn} in the Euclidean plane, with each point piassociated with a given direction vi∈ V. P(pi, vi) defines a half-plane and L(pi, vi) denotes the baseline that is perpendicular to viand passing through pi. Define a region dominated by piand vias a Baseline Bounded Half-Plane Voronoi Region, denoted as V or(pi, vi), if a point x ∈ V or(pi, vi), then (1) x ∈ P(pi, vi); (2) the line segment l(x, pi) does not cross any baseline; (3) if there is a point pj, such that x ∈ P(pj, vj), and the line segment l(x, pj) does not cross any baseline then d(x, pi) ≤ d(x, pj), j ≠ i. The Baseline Bounded Half-Plane Voronoi Diagram, denoted as V or(P, V), is the union of all V or(pi, vi). We show that V or(pi, vi) and V or(P, V) can be computed in O(n log n) and O(n2log n) time, respectively. For the heterogeneous point set, the same problem is also considered.

A Duplicate Chinese Document Image Retrieval System Based on Line Segment Feature in Character Image Block

2011 ◽  
pp. 14-23
Author(s):  
Yung-Kuan Chan ◽  
Tung-Shou Chen ◽  
Yu-An Ho
Keyword(s):  
Image Retrieval ◽  
Line Segment ◽  
Document Image ◽  
Experimental Results ◽  
Document Images ◽  
Rapid Progress ◽  
Image Block ◽  
Line Segments ◽  
Image Retrieval System ◽  
On Line

With the rapid progress of digital image technology, the management of duplicate document images is also emphasized widely. As a result, this paper suggests a duplicate Chinese document image retrieval (DCDIR) system, which uses the ratio of the number of black pixels to that of white pixels on the scanned line segments in a character image block as the feature of the character image block. Experimental results indicate that the system can indeed effectively and quickly retrieve the desired duplicate Chinese document image from a database.

Plate and line segment processes

1978 ◽  
Vol 15 (03) ◽  
pp. 494-501 ◽  
Author(s):  
N. A. Fava ◽  
L. A. Santaló
Keyword(s):  
Line Segment ◽  
Integral Geometry ◽  
Random Variables ◽  
Random Processes ◽  
Line Segments ◽  
Expected Values

Random processes of convex plates and line segments imbedded in R 3 are considered in this paper, and the expected values of certain random variables associated with such processes are computed under a mean stationarity assumption, by resorting to some general formulas of integral geometry.

ON THE STEINER RATIO IN $\mathcal{R}_{n}$

2011 ◽  
Vol 03 (04) ◽  
pp. 473-489
Author(s):  
HAI DU ◽  
WEILI WU ◽  
ZAIXIN LU ◽  
YINFENG XU
Keyword(s):  
Euclidean Space ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dimensional Euclidean Space ◽  
Minimum Length ◽  
Steiner Ratio ◽  
Line Segments ◽  
Finite Set ◽  
Steiner Minimum Tree ◽  
Set Of Points

The Steiner minimum tree and the minimum spanning tree are two important problems in combinatorial optimization. Let P denote a finite set of points, called terminals, in the Euclidean space. A Steiner minimum tree of P, denoted by SMT(P), is a network with minimum length to interconnect all terminals, and a minimum spanning tree of P, denoted by MST(P), is also a minimum network interconnecting all the points in P, however, subject to the constraint that all the line segments in it have to terminate at terminals. Therefore, SMT(P) may contain points not in P, but MST(P) cannot contain such kind of points. Let [Formula: see text] denote the n-dimensional Euclidean space. The Steiner ratio in [Formula: see text] is defined to be [Formula: see text], where Ls(P) and Lm(P), respectively, denote lengths of a Steiner minimum tree and a minimum spanning tree of P. The best previously known lower bound for [Formula: see text] in the literature is 0.615. In this paper, we show that [Formula: see text] for any n ≥ 2.

Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints

2019 ◽  
Vol 29 (02) ◽  
pp. 95-120 ◽  
Author(s):  
Prosenjit Bose ◽  
André van Renssen
Keyword(s):  
Line Segment ◽  
Large Family ◽  
Upper Bounds ◽  
The Other ◽  
Additional Property ◽  
Graph Partitions ◽  
Set Of Points ◽  
The Given

We present improved upper bounds on the spanning ratio of constrained [Formula: see text]-graphs with at least 6 cones and constrained Yao-graphs with 5 or at least 7 cones. Given a set of points in the plane, a Yao-graph partitions the plane around each vertex into [Formula: see text] disjoint cones, each having aperture [Formula: see text], and adds an edge to the closest vertex in each cone. Constrained Yao-graphs have the additional property that no edge properly intersects any of the given line segment constraints. Constrained [Formula: see text]-graphs are similar to constrained Yao-graphs, but use a different method to determine the closest vertex. We present tight bounds on the spanning ratio of a large family of constrained [Formula: see text]-graphs. We show that constrained [Formula: see text]-graphs with [Formula: see text] ([Formula: see text] and integer) cones have a tight spanning ratio of [Formula: see text], where [Formula: see text] is [Formula: see text]. We also present improved upper bounds on the spanning ratio of the other families of constrained [Formula: see text]-graphs. These bounds match the current upper bounds in the unconstrained setting. We also show that constrained Yao-graphs with an even number of cones ([Formula: see text]) have spanning ratio at most [Formula: see text] and constrained Yao-graphs with an odd number of cones ([Formula: see text]) have spanning ratio at most [Formula: see text]. As is the case with constrained [Formula: see text]-graphs, these bounds match the current upper bounds in the unconstrained setting, which implies that like in the unconstrained setting using more cones can make the spanning ratio worse.

Sign in / Sign up

Export Citation Format

Share Document