spatial Questions
2
Solved
I have (what I think) is a simple SQL Server spatial query:
Grab all the USA States that exist inside some 4 sided polygon (ie. the viewport/bounding box of a web page's Google/Bing map)
SELE...
Miguel asked 28/7, 2010 at 8:5
5
Solved
I'm writing a game where a large number of objects will have "area effects" over a region of a tiled 2D map.
Required features:
Several of these area effects may overlap and affect the same til...
Laissezfaire asked 28/6, 2010 at 19:58
1
Solved
I'm tasked with choosing the fulltext search engine we're going to be using on an upcoming projects. Based on what I've read, I'm leaning toward Solr, but I'm a little concerned about spatial searc...
4
Solved
I am designing an application that needs to save geometric shapes in a database. I haven't choosen the database management system yet.
In my application, all database queries will have an bounding...
Chantey asked 31/3, 2010 at 22:30
1
Solved
I want to use NHibernate.Spatial. I also want to use new NHibernate 3.0 features such as the improved LINQ provider and the QueryOver functionality, which are only available in NHibernate's source ...
Tamayo asked 10/2, 2010 at 5:2
6
Solved
What are some recommended frameworks for manipulating spatial data in C++?
I'm looking for a polygon object, point object, and some operations like union, intersection, distance, and area. ...
Psychomancy asked 25/6, 2009 at 21:1
1
Solved
I'm developing an application in C# that will use and store geographic locations using the data type "Geography" in SQL Server 2008. I was planning to use the Entity Framework but soon discovered i...
Oscular asked 28/12, 2009 at 0:41
4
Solved
In order to calculate the nearest locations that are represented by latitude/longitude, I was considering dividing the map into small grids, approximately 100x100 meter grids. Essentially eac...
Nondescript asked 1/12, 2009 at 8:35
2
i'm currently working on a project where i have to deal with sql server 2008 geography types.
As big parts of the projects uses NHibernate as ORM i wonder how much work it will be to use/extend NHi...
Whortleberry asked 22/12, 2008 at 8:1
5
Solved
We have a list of x,y pairs. Every pair represents a point on a 2D space. I want to find the closest point from this list, to a specific point xq,yq. What is the best performance-critical algorithm...
Shirleneshirley asked 28/10, 2009 at 20:3
6
I have a 3D pointcloud and I'd like to efficiently query all points within distance d from an arbitrary point p (which is not necessarily part of the stored pointcloud)
The query would look someth...
Lidia asked 23/8, 2009 at 13:46
6
I'm trying to determine a fast way of storing a set of objects, each of which have an x and y coordinate value, such that I can quickly retrieve all objects within a certain rectangle or circle.
Fo...
3
Solved
I have a spatially enabled database (DB2, in this case). I need to store a large number of squares in a table. Which standard spatial SQL datatype is most suitable?
I guess I could use an ST_polyg...
Lau asked 17/8, 2009 at 8:20
4
I have an app where basically I have a huge table (100 million records) of information, with each row containing a lat/long value.
I'm constantly querying this table to get all the records that fi...
Inelegance asked 27/8, 2009 at 19:23
5
I've been experimenting with different ideas of how to store a 2D game world. I'm interested in hearing techniques of storing large quantities of objects while managing the set that's visible ( let...
Tragedian asked 2/8, 2009 at 5:17
3
I'm working on a 2D game that has a huge amount of dynamic entities.
For fun's sake, let's call them soldiers, and let's say there are 50000 of them (which I just randomly thought up, it might be m...
Lurleen asked 13/8, 2009 at 12:43
1
Solved
PostgreSQL supports a variety of geometric types out of the box, along with lots of geometric operators and GiST indexes which seem to offer spatial indexing of data.
And then there's also PostGIS...
Synecology asked 21/6, 2009 at 4:50
3
Solved
given my current position (lat,long) I want to quickly find the nearest neighbor in a points of interest problem. Thus I intend to use an R-Tree database, which allows for quick lookup. However, fi...
Denishadenison asked 15/2, 2009 at 21:31
3
From the outset, collision detection feels like it is an O(n^2) problem.
You have a bunch of objects and you need to check if each object is colliding with any of the other objects. However, I kn...
Jumbo asked 5/1, 2009 at 21:14
6
Solved
I have a large number of 2D points and I want to quickly get those that lie in a certain rectangle.
Let's say a '.' is any point and 'X' is a point I want to find inside a rectangle which has 'T' a...
5
I was wondering what is the best data structure to deal with a lot of moving objects(spheres, triangles, boxes, points, etc)? I'm trying to answer two questions, Nearest Neighbor and Collsion detec...
Musso asked 24/10, 2008 at 23:56
© 2022 - 2024 — McMap. All rights reserved.