computational-geometry Questions

3

I have an array of points, and my goal is to pick two so that I maximize the area of the rectangle formed by the two points (one representing the low left corner and the other one the right top cor...
Barrage asked 21/9, 2021 at 21:55

6

Solved

I found the Computational Geometry Algorithms Library in my search for an algorithm to decompose a concave polygon into the minimum number of convex components. Links off the site and numerous goog...
Underpants asked 5/12, 2008 at 8:36

1

Solved

Is there any algorithm that can place an arbitrary rectangular inside an arbitrary polygon (I can deal with limitation to only convex polygons) in the closest available position (i.e. without inter...

2

I want to draw parallel line to given X,Y coordinate below code helps to draw , import numpy as np import matplotlib.pyplot as plt x = [187, 879, 722, 322] y = [341, 344, 112, 112] newX = [] ne...
Cithara asked 23/6, 2021 at 17:56

2

Solved

I am looking for an implementation that calculates alpha shapes in two dimensions. I am running ubuntu. I would prefer a command line utility for this task, but will also be fine with a python libr...
Australian asked 26/7, 2011 at 16:19

2

Solved

My question in short: Is it possible to constrain the domain of the Voronoi vertices generated by Qhull? If so, how can one do so? My question with context: I am working on a data visualization in...
Nemathelminth asked 25/9, 2018 at 21:5

3

Given a set of points, points = np.random.randn(...) # n 3d points I would like to uniformly fill the volume defined by the convex hull in which they lie by a list (np.array of shape nx3) of 3d...
Kingship asked 27/11, 2019 at 15:52

3

I have a set of AABBs in 3D. Each AABB keeps track of an index in another array. I would like to find and subdivide these AABBs into smaller AABBs wherever they intersect. Each new AABB created nee...
Undersheriff asked 10/2, 2021 at 10:36

3

Solved

Given a set of 2D points (black dots in the picture) I need to choose two lines to somehow represent those points. I probably need to minimize the sum of squares of [distance of x to the closer of ...
Hemichordate asked 24/2, 2021 at 10:37

9

Solved

The problem: N points are given on a 2-dimensional plane. What is the maximum number of points on the same straight line? The problem has O(N2) solution: go through each point and find the number...
Resistencia asked 14/11, 2010 at 20:40

7

Solved

The question is: Given N points(in 2D) with x and y coordinates, find a point P (in N given points) such that the sum of distances from other(N-1) points to P is minimum. This point is comm...
Shiest asked 17/10, 2012 at 12:20

7

Solved

How can I find the largest circle that can fit inside a concave polygon? A brute force algorithm is OK as long as it can handle polygons with ~50 vertices in real-time.
Quirita asked 25/11, 2010 at 17:15

4

Solved

I have a simple exercise that I am not sure how to do. I have the following data sets: male100 Year Time 0 1896 12.00 1 1900 11.00 2 1904 11.00 3 1906 11.20 4 1908 10.80 5 1912 10.80 6 1920 10.80 ...
Perimorph asked 18/11, 2020 at 13:44

1

I am trying to implement an algorithm to remove an edge and a vertex from a half edge structure. See the attached image for an illustration: I know there's libraries like Openmesh and CGAL etc...

6

Solved

Very simply, given a point A(x,y) and another point B(m,n), I need a function that can return in any iterable object a list[k,z] of all points in between. Am only interested in integer points, so ...
Hegumen asked 14/9, 2014 at 20:10

2

Solved

I'm using the following procedure to calculate hexagonal polygon coordinates of a given radius for a square grid of a given extent (lower left --> upper right): def calc_polygons(startx, starty, e...

8

Solved

I have a set of 2d points. They are X,Y coordinates on a standard Cartesian grid system(in this case a UTM zone). I need to find the holes in that point set preferably with some ability to set the ...
Plaything asked 16/2, 2014 at 21:1

2

I'm looking for an algorithm to find the polygon that surrounds a contiguous grid of squares without holes as shown here: . I already have each of the grid squares storing data about the kind of ed...

6

I have a detailed 2D polygon (representing a geographic area) that is defined by a very large set of vertices. I'm looking for an algorithm that will simplify and smooth the polygon, (reducing the ...
Discordancy asked 18/2, 2011 at 4:24

6

I have drawn a triangle mesh with 10000 vertices(100x100) and it will be a grass ground. I used gldrawelements() for it. I have looked all day and still can't understand how to calculate the normal...
Communalize asked 11/7, 2011 at 20:47

3

Solved

i'm struggling with this geometry problem right now. Let's say we have a line defined by point A(x1,y1) and point B(x2,y2) We also have a point C(x3,y3). What function written in SWIFT could give m...
Unlade asked 8/8, 2020 at 12:21

8

Solved

Given a set of points in the plane, a notion of alpha-shape, for a given positive number alpha, is defined by finding the Delaunay triangulation and deleting any triangles for which at least one ed...
Footloose asked 15/4, 2014 at 1:31

2

Solved

I have points (e.g., lat, lon pairs of cell tower locations) and I need to get the polygon of the Voronoi cells they form. from scipy.spatial import Voronoi tower = [[ 24.686 , 46.7081], [ 24.68...
Gaynell asked 23/2, 2015 at 1:3

7

Solved

Given a set of points on a plane, find the shortest line segment formed by any two of these points. How can I do that? The trivial way is obviously to calculate each distance, but I need another a...
Pettifer asked 21/10, 2009 at 16:57

2

Solved

I want to find the clockwise angle between two vectors in python the angle should be in range of (-90,90) what is the equation/code to calculate the angle ? class Vect: def __init__(self, a, b)...
Foust asked 29/12, 2018 at 13:46

© 2022 - 2024 — McMap. All rights reserved.