Questions tagged [computational-geometry]
The study of efficient algorithms and data structures to solve various problems involving point sets, line segments, polygons, polyhedra, simplices, etc.
0
votes
0answers
9 views
Use data from VRML 2.0 UTF-8 file to make a 3D representation of object with mplot3d
I have a VRML file with three types of data, points; normal-vectors; coordIndex.
I have successfully, using re, imported the data into Python. I thought I had a way of using this data to make a nice ...
2
votes
0answers
89 views
Efficient root finding algorithm for monotonic function
This is my first time asking a question here, so I may not be asking this in the right place. I am trying to find the roots of a monotonic function with as few function evaluations as possible.
I ...
3
votes
0answers
28 views
Minimum axis aliged bounding box of convex polytope
I need to compute a $n-$dimensional integral with $n<10$ on a convex polytope. Since most numerical integration libraries (e.g. Cuba) expect the function to be integrated defined inside an axis ...
1
vote
0answers
83 views
Smallest circumscribed circle in spherical geometry
I work in Python 3 on astrophysics projects. I need to compute the smallest circumscribed circle of a set of points in the sky (so described by Right Ascension and Declination). I have found a code ...
3
votes
0answers
43 views
Approximate the largest simplex in N-dimensional Delaunay triangulation
I am working on determining the spatial information of a set of $M$ points in $N$-dimensional space. It is well-known that the construction of Delaunay triangulation is expensive in high dimensional ...
1
vote
0answers
42 views
Uniformly sample a point per polytope
I want to uniformly sample a point within each of $10^5$ convex polytopes in each iteration of a solver.
The polytopes in one iteration are completely different from the polytopes in another iteration....
2
votes
0answers
72 views
How to numerically optimize affine transformations?
I need to optimize affine transformations for of a set of triangles using energy function based on the connectivity.
The energy of an edge $e_j$ between triangles $T_a, T_b$ is given by
$$
E_j = \...
-1
votes
1answer
78 views
Compute outward normal and surface area for 8 noded brick element in FEA
I have a cube which is divided into 8 small cubes by bisecting each edge, I am trying to find out the surface area of each of the faces and the corresponding outward normals for them. This operation ...
-1
votes
1answer
80 views
Connectivity matrix in Finite Element Method in Triangular elements
Imagine a simple triangular base mesh in finite element method with an unknown number of elements (varying by the user). How can connectivity matrix be coded to be generated automatically?
6
votes
1answer
216 views
Putting N hard spheres randomly in given volume
I need to put $N$ spheres with given radius $R$ randomly in a Volume $[-0.5,0.5]^3$, without any overlap of spheres.
If I choose values so that all the spheres will occupy ~57% of the total volume, I ...
1
vote
0answers
148 views
Use of Morton Key to reduce number of grid points
I asked a question on Stack Overflow Performance Issue with VP Trees and Nearest Neighborsand I was not satisfied with the answer and so I thought I would reword my question for this site and post ...
1
vote
2answers
112 views
Uniform dots distribution in a sphere
I'm trying to implement Barnes-Hut algorithm, with a binary tree. My initial conditions are a uniform mass distribution in a sphere with radius $R$. How can I create uniform dots distribution in a ...
2
votes
1answer
118 views
Can the Power Method be used here?
Given a set of $n$ points on which a triangulation is performed, it is possible to construct coefficients $\lambda_{ij}>0$ such that each point $x_i$ is a convex combination of the points connected ...
2
votes
0answers
65 views
Simultaneous update to barycenters
Suppose a tiling is given in 2D (an embedding of a planar triangulated graph), with all faces convex.
Now suppose one moves each point, one by one, to the barycenter of its neighbors. I think that ...
4
votes
0answers
76 views
What Derivative-free optimization method should I use when my initial guess is very good?
I am trying to minimize a function where my initial guess is quite close to the minimum.
I'm trying to minimize
$$f(q) = \text{angle}(qw_1q*, v_1) + \text{angle}(qw_2q*, v_2) + \text{angle}(qw_3q*, ...
4
votes
2answers
465 views
3D contour mesh computation
I have the value of a function in three dimensions, $f(x, y, z)$, which varies smoothly.
I would like to compute a 3D mesh where $f(x, y, z)$ has a particular value.
Are there algorithms to do this? ...
5
votes
1answer
141 views
Integrating/Implementing NURBS-related calculations
Recently, I started to develop some codes that use NURBS (general things I intend to use/already using: spline generation, interpolation, grids, isolines, closest-point find, and many others), both ...
2
votes
1answer
58 views
Polygon approximation with a circle
There is an article describing how to detect a pupil from an eye photo.
A.-H. Javadi, Z. Hakimi, M. Barati, V. Walsh, and L. Tcheang, "SET: a pupil detection method using sinusoidal approximation," ...
3
votes
0answers
70 views
Fast Algorithms for the Simplicial Decomposition of a Convex Polytope in N-Dimensions
I'm in the process of constructing an algorithm which computes the Voronoi diagram of a set of points, but I now need a method to decompose each Voronoi cell into simplices. The information we have is:...
1
vote
0answers
44 views
Efficient initial identification of solid or liquid domains for a block structured Cartesian grid generation system
INTRO
Within the last 5 days I was able to generate a block structured Cartesian grid
generation system with a combination of Fortran,C++ and Python.
I am running intersection tests of the ...
0
votes
0answers
56 views
Free Form Deformation Library
I am looking for an Open Source Free Form Deformation library to morph / deform existing geometries given as a set of points (vertices of cells).
I came across PyGeM (python) and
mimmo (C++).
I ...
0
votes
1answer
110 views
Which free library should I use to perform cutting/clipping operation?
I have a set of points which forms a closed loop, and I want to perform cutting/clipping a 3D model using this loop. I have used VTK but in some cases, it has a "Cannot follow edges" problem.
Is ...
0
votes
1answer
54 views
Gmsh exporting wrong mesh DATA [closed]
so hopefully I'll be using gmsh to make meshes out of 2-D cross sections with o thickness. I tried to make a structured mesh with quad elements of a rectangular ...
4
votes
1answer
181 views
Expanding Winding Number algorithm to arcs
I have a problem that I have been attempting to solve for a few days now. I was wondering if I would be able to get some assistance from the community.
In order to detect if a point is in a polygon, ...
3
votes
1answer
108 views
Compute mesh of the projection of a 3D surface triangulation
Given a triangulated surface in $\Bbb{R}^3$ we can simply project it on a plane. This will result in a family of triangles which do not form a mesh of the projection for the following reasons:
each ...
7
votes
2answers
957 views
Efficiently finding all (x,y,z) points within certain distance of point P
I am using Python, and I have a Pandas dataframe with hundreds of thousands, if not millions, of $(x,y,z)$ coordinates. I am looking to find an efficient method to index the original dataframe so that ...
0
votes
1answer
52 views
Detect all “visible” points on a triangulated surface
I have a triangulated surface that I want to work with. In order to optimize certain quantities related to this surface I want to find all points which are accessible from a given direction. To be ...
2
votes
2answers
108 views
Algorithm to construct all distances of a system described by $3N-6$ distances
A non-linear molecule has $3N-6$ degrees of freedom ($N$ is the number of atoms; ignoring translation and rotation). Therefore, a set of $3N-6$ distances and/or angles is enough, to describe the whole ...
4
votes
1answer
109 views
Delaunay triangulation for datasets with four or more co-circular points
I am working on a library that requires subdivision of polygons into triangles. The polygons are divided into triangles by (more or less) random points that are inside them. In general, the approach ...
2
votes
2answers
104 views
Find connected circles
I have a problem as follows:
We have a set of circles (we know the radius r and the center point c in Rd of each circle)
We ...
7
votes
2answers
137 views
Generating set of points on a surface defined by constraint
I'm writing a differential geometry library, and one minor convenience I'd like to offer is to generate a set of points on a surface given by a constraint. For example, for a sphere,
$$x^2+y^2+z^2-r^...
0
votes
1answer
103 views
Linear Least-Squares Point-to-Plane ICP degenerative case
I'm trying to implement Linear Least-Squares Optimization for Point-to-Plane ICP Surface Registration
Paper describes linear approximation for point to plane distance for rigid ICP. This approach is ...
0
votes
3answers
54 views
Is it valid to assume the center of a bounding sphere to be also the center of the bounding box?
Computing an axis aligned bounding box of a point set is trivial. Computing a bounding sphere of a point set is also trivial when the center is known. Computing the center of the bounding sphere is ...
3
votes
4answers
267 views
find grid points inside the parallelogram defined by an origin and two vectors
I hope someone knows an efficient computational approach to the following 2D problem:
Given two vectors $\mathbf{A}$ and $\mathbf{B}$, find all grid points that lie within the parallelogram spanned ...
6
votes
4answers
1k views
Generate a set of orthogonal vectors to a given vector
I am looking for an alternative and robust alternative to Gram-Schmidt orthogonalization, but with one constraint:
I have a unit vector $\mathbf{v}_1 \in \mathbb{R}^d \,\text{s.t.} \,\|\mathbf{v}_1^T\...
1
vote
2answers
131 views
Sign of integer determinant 4 by 4
I'm in the context of this publication: http://www.gilbertbernstein.com/resources/booleans2009.pdf
I applied quantization to my point coordinates: All coordinates are integer lying in [0, 2 power 20]....
1
vote
1answer
53 views
Sources for verified Voronoi and power diagrams
In the course of trying to implement algorithms for Voronoi and Laguerre diagrams, I realized I needed to verify if my implementation is working correctly using a point (or circle) configuration with ...
0
votes
1answer
273 views
Algorithms to extract trajectory lines out of 3D point clouds
I am looking for different approaches to extract 3D polylines out of Point Clouds.
We are able to create these point clouds out of different data sources of real world surveys (LIDAR, RADAR, etc...) ...
0
votes
1answer
72 views
What is the expected value of area of intersection of a circle and a rectangle
$r$: cicle C1's radius
$w$,$h$: rectangle R1's edges: $x=w$, $y=h$, $x=0$, $y=0$
$(w>2r, h>2r)$
$S(x,y)$: area of ...
1
vote
0answers
33 views
Algorithms for computing winding numbers of 2-sphere maps
I have a question concerning computational geometry which arises in the simulation of fields with topological defects, and I'd like to know whether there's an efficient algorithm (or any algorithm) to ...
1
vote
1answer
61 views
Optimally “morph” one set of points into another
Given two sets of (two-dimensional) points, say, $A=\{a_1,a_2,\ldots,a_{n_a}\}$ and (you guessed it) $B=\{b_1,b_2,\ldots,b_{n_b}\}$, and $d^2_{i,j}=\mid a_i-b_j\mid^{\ 2}$ the "matrix" (not ...
0
votes
1answer
52 views
Efficient search strategy in a monotonic boolean function wherein the probability of solution location is known apriori
A boolean-valued monotonic function is defined in the set of positive integers, $\mathcal Z$.
$$f(n) = \begin{cases} 0, &n_{min}\le n < n\ast\\1, &n\ast\le n\le n_{max} \end{cases} ; n \in ...
1
vote
1answer
65 views
Distirbution of Points along a Line
I am facing the following problem:
Given is a line of length $L$ which I want to split into $N$ segments. The lengths of the first $(s_1)$ and last segment $(s_N)$ are given.
You can assume that the ...
1
vote
0answers
25 views
Use custom defined metric(not matrix) in Javaplex
I'm about to get started trying to use Javaplex for the first time for some application in topological data analysis (TDA) and I want to use a custom defined metric. From looking over the documents, I ...
0
votes
1answer
104 views
From edge-vertex connectivty to face-vertex connectivity?
I am working on mesh generation and optimization and encountered this problem. For example, in the figure below, we have the edge-vertex connectivity:
0-1
1-4
4-5
2-5
3-2
0-3
1-2
1-6
7-6
4-7
...
1
vote
1answer
97 views
Efficiently determine whether a curve intersects a given rectangle?
Suppose we have a straight line in Cartesian space such that
$$ x_k = x_0 + k \delta x, \quad \quad y_k = y_0 + k \delta y, \quad \quad z_k = z_0 + k \delta z $$
where $k$ can take any real value. If ...
1
vote
1answer
78 views
Why rational numbers in the Lenstra–Lenstra–Lovász algorithm?
The Lenstra–Lenstra–Lovász (LLL) algorithm is a famous one for lattice reduction. But concerning its application, I am always baffled by one point.
The algorithm applies equally well to irrational ...
2
votes
0answers
55 views
How to model pedestrian flow through subway systems?
I'm a New Yorker and take the subways every day. I have a growing interest in understanding the distribution of paths people take on the subways to work every day.
I.e. if there are $n$ subway ...
10
votes
2answers
346 views
Fitting Implicit Surfaces to Oriented Point Sets
I have a question regarding quadric fit to a set of points and corresponding normals (or equivalently, tangents). Fitting quadric surfaces to point data is well explored. Some works are as follows:
...
3
votes
2answers
231 views
How do I find the smallest set of elements that covers a given shape?
Suppose I have a mesh consisting of a set $M$ of conformal elements that fill the region $R=[0,1]\times[0,1]$. Suppose that I also have a 2D shape $S\subset R$ whose boundary $\partial S$ is ...
