Skip to main content
Filter by
Sorted by
Tagged with
0 votes
1 answer
98 views

I have two distinct shapefiles that have a high degree of overlap, but aren't the same. I want to make a comparison and one of the things I would like to generate is the Jaccard Index of regions ...
BLP92's user avatar
  • 345
1 vote
1 answer
110 views

The first_intersection() function of CGAL returns the origin of the ray every time instead of the real first intersection (with the origin point ignored, as it should be). I am working with an AAABB ...
Samuel Bergé's user avatar
2 votes
0 answers
67 views

Summary of Code: The code takes a 2D array, takes the (x,y) gradients of the 2D array with numpy, gets the contours of the x- y-gradients with matplotlib.pyplot, and finds the intersections between ...
JMiller's user avatar
  • 21
0 votes
1 answer
26 views

I have a Task with a @ManyToMany referenced roles, which specify roles a user must have at least one of, to perform the task. The HQL search should therefore find all tasks that have at least one of ...
Matthias Ronge's user avatar
2 votes
1 answer
86 views

I need to find the intersection of a straight line and a stress-strain curve to determine the offset yield strength. I've been trying to use the following code, which successfully prints the curve ...
Clem Entwistle's user avatar
2 votes
1 answer
106 views

In general, a turf polygon can be converted to Leaflet as per https://gis.stackexchange.com/questions/448435/converting-turf-polygon-to-leaflet-polygon . But there seems to be a difficulty when the ...
Alasdair's user avatar
  • 1,414
0 votes
2 answers
215 views

I have done quite a lot of looking around now, and I am wondering if anyone knows more about the functionalities of the libraries I have looked into, or whether I missed some things. I am trying to do ...
Thomas Kroißenbrunner's user avatar
6 votes
4 answers
419 views

I've referenced this answer (has an interactive desmos visualization) in a related question to develop this Javascript function: function doLineSegmentsIntersect(a1X, a1Y, a2X, a2Y, b1X, b1Y, b2X, b2Y)...
Ryan Peschel's user avatar
  • 12.1k
0 votes
1 answer
75 views

I'm working with spatial data in R using the sf package, and I need to identify geometries that are completely within a larger geometry (not just intersecting or touching boundaries). In other words, ...
Pedro Alves's user avatar
0 votes
1 answer
114 views

Potentially unnecessary background: I am attempting to calculate the sinuosity of road within a 500m buffer of a point on that road. Workflow is: Buffer the point 500m Use that buffer to clip the ...
Chad Apol's user avatar
2 votes
1 answer
210 views

I am having an issue obtaining a linestring from an intersection with a polygon using GeoPandas. The linestring is self-intersecting, which is what is causing my issues. A line intersecting a polygon: ...
Jet-Cadet's user avatar
0 votes
0 answers
78 views

I'm trying to extract data from osm to use in an anlysis, but I'm having trouble with sf::st_intersection. Reprex below, # load libraries library(osmdata) # osmdata co = opq_osm_id(type = "...
user13317's user avatar
  • 507
2 votes
0 answers
45 views

I am trying to figure out why a random point layer that I have created based upon a line layer has NO intersections with that line layer... Below is reproducible code that shows the problem. library(...
Chad Apol's user avatar
0 votes
1 answer
112 views

I am currently working on a project in Lua that involves calculating the intersection points of two ellipses that share a common focus O. The parameters for the ellipses include the coordinates of ...
darkfrei's user avatar
  • 638
0 votes
3 answers
243 views

I have a 1km buffer shapefile and a roads shapefile and I'm trying to figure out the total length of roads that intersect with each buffer so I can calculate road density within each buffer. There are ...
Bridget Wheelock's user avatar
0 votes
1 answer
75 views

I am working on a Python script using Pandas to analyze event data. My goal is to calculate the intersection of active events. My code works fine if the same event doesn't happen twice. However, if it ...
slow_learner's user avatar
0 votes
0 answers
154 views

I'm currently trying to figure out a rendering approach for implicit geometry which involves a ray intersection algorithm for oriented rounded box primitives. It's just a small toy project and I'm not ...
Chribit's user avatar
  • 83
0 votes
0 answers
103 views

I have that start of a simple handmade diagram app (boxes and arrows) in SVG. I want to detect overlapping boxes with svgelement.getIntersectionList() - MDN I am getting a weird result - the ...
Andrew Cruickshank's user avatar
-1 votes
2 answers
148 views

This post is a continuation of the previous posts: Intersection of the range of values MongoDB - Intersection of the range of multiple row values MongoDB: Intersection of the range of multiple row ...
Valentin Borisenko's user avatar
0 votes
2 answers
160 views

Suppose we have a mongodb collection with 6 columns: RoomFrom RoomTo PoolFrom PoolTo FloorFrom FloorTo Now I would like to select rows where range *From / *To intersect with another ranges. For ...
Valentin Borisenko's user avatar
-1 votes
1 answer
68 views

Suppose we have a mongodb collection with 2 columns: From, To. Now I would like to select rows where range From / To intersect with another range. For example: Object #1: From = 100, To = 200 Object #...
Valentin Borisenko's user avatar
0 votes
0 answers
80 views

I have a data.frame in R which has more or less this structure: structure(list(F1 = c(1, 2, 3, NA, NA), F2 = c(NA, 2, 3, 4, NA ), F3 = c(NA, NA, NA, 4, 5)), class = "data.frame", row.names = ...
Alejandro Carrera's user avatar
1 vote
2 answers
67 views

In principle (T & Record<K, U>)[K] should evaluate to U but it doesn't seem to work in the case where K is generic and extends a template literal. function foo3< K extends `a${string}`...
Exifers's user avatar
  • 2,932
0 votes
0 answers
140 views

I am trying to perform the intersection of 3 cones with python. In particular, I'm using PyVista to generate the cones in the 3D space and then I use the boolean_intersection function to get the ...
user27095394's user avatar
0 votes
1 answer
163 views

I have a set of vector layers in R, and I want to keep only those polygons in each layer that intersect across all layers. In other words, a polygon should only be kept if it intersects with a polygon ...
Marlene_'s user avatar
2 votes
0 answers
68 views

For reference, I've implemented this algorithm for inflating/deflating polygons: https://www.baeldung.com/cs/polygons-inflating-deflating However, for joining edges, instead of using rounded corners, ...
7z99's user avatar
  • 33
1 vote
1 answer
90 views

There is a small sketch based of original ThreeJS DecalGeometry example and it works fine. Basically, it has to add logo to the tank center by X axis perpendicular [{0, 0, 0}, {tankRadius, 0, 0}] and ...
toowren's user avatar
  • 113
0 votes
1 answer
306 views

I want to calculate the intersection points between an ellipse and a line using python. However how do I do it using only mathematical quadratic equation, when given both end points of the line and ...
Lion In A Box's user avatar
0 votes
2 answers
115 views

I'm looking for an algorithm that returns (the length of) the intersection of two given N^4 lists / sets (more precisely in [|0;7|]^4). I'm not expecting an answer in a specific programming language (...
SerialCookie's user avatar
0 votes
2 answers
417 views

I have a massive gdb of lots of polygons, many of them overlapping (sometimes partial overlaps and sometimes full overlaps). The polygons represent landscape treatments with different attributes I'd ...
user23425027's user avatar
0 votes
1 answer
87 views

I need a function that, given two or more polygons, can divide the sides into the intersections of the sides as in the figure, how would I do it? An example would be the meeting of two sides [(0.0, 0....
Rodrigo Chueri's user avatar
0 votes
0 answers
52 views

I want to compare my own algorithm with CGAL's halfspace intersection algorithm in terms of their speed performance. Since I did my own operations with double, I obtain inexact constructions of points ...
Merve A's user avatar
  • 31
2 votes
1 answer
787 views

As mentioned here: Efficient way to compare an partition two collections in Kotlin I am working on a Kotlin application that needs to compare lists of Json objects. To find the elements that are ...
pbuchheit's user avatar
  • 1,839
2 votes
0 answers
170 views

There exist n rectangles in a 2D plane. We have 2D integer arrays bottomLeft and topRight, both of size n x 2, representing the bottom-left and top-right coordinates of the ith rectangle respectively. ...
Akshat Parashar's user avatar
1 vote
1 answer
357 views

In my code I have two lines (line1, line2) that definitely visually intersect one another. They are simply stock lines with data scraped from yfinance, but when running line1.intersect(line2), it ...
Sam's user avatar
  • 13
0 votes
1 answer
84 views

I am trying to find the intersection points between two lists of funtions in geogebra. Let's say I have the folowing two lists of functions: offset = {1,2} l1 = x + offset l2 = -x - offset Now I want ...
dedpunkrz's user avatar
  • 178
2 votes
1 answer
81 views

according to this post in stack overflow, lookahead assertion can work like a type of intersection of regular expressions, but I really have no idea why it works. can someone explain to me? Look at ...
Raúl Girón's user avatar
2 votes
2 answers
66 views

Imagine I have a dataframe like this: With lists of elements in a single string. data = {'Col1': ["apple, banana, orange", "dog, cat", "python, java, c++"], 'Col2'...
Caterina's user avatar
  • 1,117
0 votes
0 answers
97 views

enter code hereI have a problem. I'm trying to write code. The goal is that if two svg shapes possibly intersect, they cannot intersect. But my code works out so that if the shapes intersect, they get ...
MaksSTV's user avatar
0 votes
0 answers
98 views

I need to turn nested generic types into a array of arrays based on how deeply nested it was. Context I'm building a query builder for linked data. The dev using this can use regular objects with get/...
Flion's user avatar
  • 11.1k
0 votes
1 answer
103 views

Short version: If E is a general conic section, and L is a line through it, I want something like: P = board.create('intersection',[L,E,0]); Q = board.create('otherintersection',[L,E,P]); except ...
Alasdair's user avatar
  • 1,414
0 votes
2 answers
163 views

The below source code is supposed to find an intersection between two curves. However, the function is unable to detect the intersection point. How can I fix it? using MathNet.Numerics.Interpolation; ...
user366312's user avatar
  • 17.5k
0 votes
0 answers
120 views

I am trying to determine the space for each of the rectangles (red, blue, orange, etc) where there is no other rectangles intersecting. The points of each rectangle is known. The number of rectangles ...
Blake O'Sullivan's user avatar
0 votes
2 answers
63 views

I am making a 2d java game, where player needs to shoot tiles. I encountered a bug in my code, the bullet destroys nearby tiles, but not always and not properly. PROBLEM VIDEO RECORD You see, I want ...
Emil Coder's user avatar
0 votes
1 answer
42 views

I am looking for a solution to a problem similar to this one: Match rows of a matrix to the rows of another, regardless of the column order? But the difference is that I am using strings and not ...
Sky Scraper's user avatar
1 vote
1 answer
91 views

I am solving a rectangle geometry USACO problem and have an issue when calculating the intersection area of two rectangles. Summing up the problem for you, you are given three rectangles' lower-left ...
Dolfinwu's user avatar
  • 419
0 votes
1 answer
138 views

I have a set of points where x is in [-1, 1], y is between [-1, 1], and the maximum sum between abs(x) + abs(y) = 1. I want to fit an ellipsis (95% CI) and then calculate the are of the ellipsis ...
understorey's user avatar
0 votes
1 answer
1k views

I've been struggling for 2 days with an Intersection Observer I have an App.vue, where there are a bunch of boxes (.box), you discover more boxes as you scroll, and there can be multiple boxes visible ...
AnnaGino's user avatar
0 votes
1 answer
60 views

I am already using a Mongo db Aggregate Query to get a array of output. email will be the array of emails as input in the query. **aggregateQuery** = [ { '$match': { 'email': { ...
Vishal Gupta's user avatar
1 vote
1 answer
234 views

I tested HashMap retainAll method to test which one is faster with JMH. Two HashMap A, B Size : A > B, A : 300~400, B : 100~200 Most of B elements is in A, so B - A is like 10~20, very small Test ...
박효상's user avatar

1
2 3 4 5
51