Stack Overflow
Stack Overflow

Questions tagged [line-segment]

90 questions
0
votes
0 answers

Three.js remove holes / inner lines in LineSegments

I create a Buffergeometry with my data and extract LineSegments to only show the outer lines: const geometry = new THREE.BufferGeometry(); geometry.setAttribute('position', new THREE.BufferAttribute(vertices, 3)); const edges = new…
Stephan Häberle
  • 340
  • 2
  • 14
0
votes
0 answers

Clustering similar lines with HDBSCAN

The image above is a frame from a video. The ultimate goal is to detect the gate. What I want to do is cluster lines similarly to the circles, where the lines that are not circled are outliers. My findings tells me this is a HDBSCAN problem so I…
Luka Jozić
  • 162
  • 2
  • 12
0
votes
1 answer

Paraview create line segments from CSV with "width" data

I want to create line segments in Paraview. The format of my input data for each line segment is as: x0,y0,z0,x1,y1,z1,width I have tried using "Line" command like: for i in range(600): l =…
Hamid Rajabi
  • 59
  • 1
  • 8
0
votes
1 answer

How can I use 2D infinite lines as keys of an associative container that can be queried by proximity?

I have a thousands of line segments that I'd like to cluster by colinearity. One way to do this is to make an associative container with keys that are infinite lines. With such a container I could use a collection of line segments as values and add…
jwezorek
  • 8,592
  • 1
  • 29
  • 46
0
votes
1 answer

Fast sorting of tuples with unsorted content into chains

I want to sort the list of tuples [(0, 9), (5, 4), (2, 9), (7, 4), (7, 2)] to result in [(0, 9), (2, 9), (7, 2), (7, 4), (5, 4)]. More specifically, I have a set of edges (line segments) that I want to connect into chains (polylines). The order of…
Christoph Klemmt
  • 23
  • 4
0
votes
0 answers

Find a boundery from set of 3d line segments

I have a set of n 3d line segments [(p1_start,p1_end), (p2_start,p2_end),....(pn_start,pn_end)]. (I believe that they shod be nin-intersecting...) These segments represent a (closed) boundary. I am looking for effective algorithm to generate this…
YAKOVM
  • 9,805
  • 31
  • 116
  • 217
0
votes
3 answers

Three.js distance between point and line segment

In Three.js, I have an easy method for finding the distance between a point (being the location of my camera) and a line that extends infinitely. However, what I really need is to find the distance between a point and a single line segment made from…
Chewie The Chorkie
  • 4,896
  • 9
  • 46
  • 90
0
votes
0 answers

Java: Using line segments to define a 2D shape and avoid gaps

I am working on a code concept (Java) in which the user will click on points to indicate points on the outline of a simple 2d structure. My plan was to compose the shape of multiple line segments. I will then need to calculate the distance (overlap…
2one
  • 1,035
  • 3
  • 17
  • 36
0
votes
1 answer

Find all line segment pairs with distance less than a certain bound

Let L1,...,Ln be n different line segments in the plane (IR^2). They shall be pairwise non-intersecting. Furthermore let r signify a distance (a real value). Consider the problem of finding all pairs (i,j) where the (euclidean) distance of Li and Lj…
Jürgen Böhm
  • 389
  • 3
  • 11
0
votes
1 answer

Any known linear algorithm to approximate a function with line segments?

I have a function given by a list of points, ex: f = [0.03, 0.05, 0.02, 1.3, 1.0, 5.6, ..., 13.4, 12.45] I need an algorithm (with linear complexity) to "cut" this function/list into K intervals/sublists so that each interval/sublist contains…
user12546101
0
votes
1 answer

Find common endpoint of two 3d line segments

So i have two 3d line segments A and B the only givens are the origins of both line segments and their lenghts. I need to oriente the two line segments in a way that they end at the same position. EX: point3d common_end_position; bool result=…
Astros257
  • 13
  • 6
0
votes
1 answer

Find connected branches from list of line segments

Problem I have a list of line segments: exampleLineSegments = [(1,2),(2,3),(3,4),(4,5),(5,6),(4,7),(8,7)] These segments include the indices of the corresponding point in a separate array. From this sublist, one can see that there is a branching…
BennyS
  • 35
  • 1
  • 7
0
votes
2 answers

how to detect whether two segments (in 3d space) intersect?

only check，no need to find the point. coordinate z is not = 0. The old questions in stack overflow are all for 2d. Thanks in advance
James Chen
  • 11
  • 1
  • 3
0
votes
1 answer

How to connect several points with an arrow omitting ggplot2

I made an ordination of a time series of some vegetation data, using the vegan package. Since ordination diagrams often are cluttered with many data points, I extracted the eigenvalues of the first two ordination axes and took the mean of each…
Stevestingray
  • 399
  • 2
  • 12
0
votes
2 answers

Finding Overlapping Line segments in 2D

point a = [1,0] point b = [3,0] point c = [3,3] point b' = [3,0] Joining these points would give the line path a->b->c<-b' There is an overlap between b to c and back to b` to c. I want to find all the overlapping paths. The problem I'm…
vito
  • 473
  • 1
  • 7
  • 17
1 2 3 4
5
6