# Tagged Questions

The study of efficient algorithms and data structures to solve various problems involving point sets, line segments, polygons, polyhedra, simplices, etc.

124 views

### Fortran round-off error with floating point operations

I have simple code, which flags nodes with in region enclosed by cylinder. On implementing the code, the result is mild tilt of the cylinder observed case with $\theta=90^{\circ}$. The algorithm for ...
28 views

### volume of a region, Hilbert space [on hold]

How approximate the volume of a region delimited between two curves, f and g, by means of dot product in Hilbert space?
86 views

### How to “smoothen” (not just refine) a 2D/3D polygonal mesh

Suppose I have a complicated structure given in 2 or 3 dimensions as a polygon mesh. For example, this could represent a "cave" or an assembly of irreguar shaped particles or a tree, whatever. Now I'd ...
53 views

### computational complexity for computing perimeter of a polygon

What is computational complexity for computing perimeter of a polygon of $n$ vertices? The polygon is not necessarily regular and can be convex or non-convex.
27 views

### How is a satellite's orbit calculated using only ground to satellite range measurements?

This task is often done in a process known as Satellite Laser Ranging (SLR). SLR stations (of known coordinates) track satellites, recording range measurements to the satellite at known times. I would ...
70 views

### Pure math questions arising in computer vision, and the need for mathematicians to solve them [closed]

I've read in several articles/answer written by CS (grad) students or other people that the advanced knowledge of pure math that's required for certain areas of computer vision is sometimes too high ...