Hi!
Actually I have to solve the following problems:
Given is a dynamic set S of (moving, vanishing and arising) points
(2D). It could be the case that |S|>100 or even >1000 but not >20000.
In general almost all of the current members of S are moving all the
time.
For a single point p of S I want to find
A) All other points which are in a given circle around p
B) The nearest neighbor of p
I think a voronoi partition of the plane with respect to S should be
the key to solve the problem. So I look for a vb implementation of this
algorithm. It would be fine to have an algorithm which also can handle
insert and delete of points and which is able to deliver an almost
correct voronoi diagram for moved objects without a complete new
calculation if the shift is sufficient small.
Can anybody help?
GFM GToeroe 4 1676
Not sure if Delaunay Triangluation could help but this article says it"s
closely related and it have several implementations : http://astronomy.swin.edu.au/~pbourk...g/triangulate/
If not already done I would start by the more straightforward algo and would
switch to a more elvoved one if really needed (for example you could quickly
test the difference in x and y to quickly reject points and you have to
compute the exact distance only for those who could match).
Good luck.
--
Patrice
"GFM GToeroe" <gf*@gtoeroe.de > a écrit dans le message de news: 11************* ********@g10g20 00...legro ups.com... Hi!
Actually I have to solve the following problems:
Given is a dynamic set S of (moving, vanishing and arising) points (2D). It could be the case that |S|>100 or even >1000 but not >20000. In general almost all of the current members of S are moving all the time.
For a single point p of S I want to find
A) All other points which are in a given circle around p B) The nearest neighbor of p
I think a voronoi partition of the plane with respect to S should be the key to solve the problem. So I look for a vb implementation of this algorithm. It would be fine to have an algorithm which also can handle insert and delete of points and which is able to deliver an almost correct voronoi diagram for moved objects without a complete new calculation if the shift is sufficient small.
Can anybody help?
GFM GToeroe
> Given is a dynamic set S of (moving, vanishing and arising) points (2D). It could be the case that |S|>100 or even >1000 but not >20000. In general almost all of the current members of S are moving all the time.
For a single point p of S I want to find
A) All other points which are in a given circle around p B) The nearest neighbor of p
I think a voronoi partition of the plane with respect to S should be the key to solve the problem.
I think not, because cell phone masts dont move, but your points do. I
would use square grids for this problem. Represent your set S as a
collection of collections. Let S be a collection keyed on the grid (eg by
the grid's center x,y). Within each of these collections are all of the
points that are currently contained in the grid. As a point moves from one
grid to another, you have to remove it from one collection and add it to
another. Don't make the grids too small or you will spend too much time
moving points from one grid to another.
To find all points at a given distance or less from point P, you can
calculate which grids need to be checked, and then use brute force code to
check all points in the relevant grids. Don't make the grids too big or you
will gain no search advantage (ie you will check many more points than you
really need to).
Not sure if I understand your problem exactly but given a point "p", you
might consider:
Keep a grid and every time a point is entered, set it's grid number then for
the point, Calculate the distances beween p and all the other points in the
grid to find the ones which are within the circle radius distance and keeping
track of the minimum distance.
--
Dennis in Houston
"GFM GToeroe" wrote: Hi!
Actually I have to solve the following problems:
Given is a dynamic set S of (moving, vanishing and arising) points (2D). It could be the case that |S|>100 or even >1000 but not >20000. In general almost all of the current members of S are moving all the time.
For a single point p of S I want to find
A) All other points which are in a given circle around p B) The nearest neighbor of p
I think a voronoi partition of the plane with respect to S should be the key to solve the problem. So I look for a vb implementation of this algorithm. It would be fine to have an algorithm which also can handle insert and delete of points and which is able to deliver an almost correct voronoi diagram for moved objects without a complete new calculation if the shift is sufficient small.
Can anybody help?
GFM GToeroe
Dennis schrieb: Not sure if I understand your problem exactly but given a point "p", you might consider:
Keep a grid and every time a point is entered, set it's grid number then for the point, Calculate the distances beween p and all the other points in the grid to find the ones which are within the circle radius distance and keeping track of the minimum distance.
-- Dennis in Houston
"GFM GToeroe" wrote:
Hi!
Actually I have to solve the following problems:
Given is a dynamic set S of (moving, vanishing and arising) points (2D). It could be the case that |S|>100 or even >1000 but not >20000. In general almost all of the current members of S are moving all the time.
For a single point p of S I want to find
A) All other points which are in a given circle around p B) The nearest neighbor of p
I think a voronoi partition of the plane with respect to S should be the key to solve the problem. So I look for a vb implementation of this algorithm. It would be fine to have an algorithm which also can handle insert and delete of points and which is able to deliver an almost correct voronoi diagram for moved objects without a complete new calculation if the shift is sufficient small.
Can anybody help?
GFM GToeroe
Yes, this is the street I'm currently going on. Because I figured out
another problem: The data is often clustered very high as the points
stand for example for swarms or objects which chase all the same prey.
So I will work with a list of lists defined by a dynamic grid which is
binded to a suited function of the max speed the objects can have. Also
I will research if lists which contain the objects sorted tby x,y,r,phi
could improve the algorithm.
Thanks to all
Gabor This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics |
by: James Cameron |
last post by:
Hi I'm developing a program and the client is worried about future
reuse of the code. Say 5, 10, 15 years down the road. This will be a
major factor in selecting the development language. Any comments on
past experience, research articles, comments on the matter would be
much appreciated. I suspect something like C would be the best based
on comments I received from the VB news group.
Thanks for the help in advance
James Cameron
|
by: Jason Sirota |
last post by:
I am an advanced database and vb programmer but recently my position
has called for advanced archtecture descisions enterprise-wide.
Although I have quite a bit of knowledge on designing relational and
normalized data structures I would like to further my knowledge on
large-scale distributed database design and maintenance.
Can anyone suggest a decent to good book covering some of the more
advanced topics of enterprise databases and...
|
by: Cardman |
last post by:
Greetings,
I am trying to solve a problem that has been inflicting my self
created Order Forms for a long time, where the problem is that as I
cannot reproduce this error myself, then it is difficult to know what
is going on.
One of these Order Forms you can see here...
http://www.cardman.co.uk/orderform.php3
|
by: jeff regoord |
last post by:
A user inputs a float value. The scanf() function gets the value.
However, I need to create an error handler with an if else statement
saying invalid input if the input is not a number. Does anybody know
how I could do this?
|
by: Walid |
last post by:
Hi,
Any suggestion for a good C# book for advanced level.
thnx
| |
by: pemo |
last post by:
What would expect to be covered?
Say you'd already attended a course, that had covered stuff like structs,
pointers, bitwise and logical operators, multi-demensional arrays , *but* hadn't covered other stuff like recursion, unions, bit-fields
.
What topics would /should be covered on a course that takes students
further?
|
by: TPJ |
last post by:
Help me please, because I really don't get it. I think it's some stupid
mistake I make, but I just can't find it. I have been thinking about it
for three days so far and I still haven't found any solution.
My code can be downloaded from here:
http://www.tprimke.net/konto/PyObject-problem.tar.bz2. There are some
scripts for GNU/Linux system (bash to be precise).
All you need to know is that there are four classes. (Of course, you
may...
|
by: efrat |
last post by:
Hello,
I'm planning to use Python in order to teach a DSA (data structures
and algorithms) course in an academic institute. If you could help out
with the following questions, I'd sure appreciate it:
1. What exactly is a Python list? If one writes a, then is the
complexity Theta(n)? If this is O(1), then why was the name "list"
chosen? If this is indeed Theta(n), then what alternative should be
used? (array does not seem suited for...
|
by: robert maas, see http://tinyurl.com/uh3t |
last post by:
I'm working on examples of programming in several languages, all
(except PHP) running under CGI so that I can show both the source
files and the actually running of the examples online. The first
set of examples, after decoding the HTML FORM contents, merely
verifies the text within a field to make sure it is a valid
representation of an integer, without any junk thrown in, i.e. it
must satisfy the regular expression: ^ *?+ *$
If the...
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However, people are often confused as to whether an ONU can Work As a Router. In this blog post, we’ll explore What is ONU, What Is Router, ONU & Router’s main usage, and What is the difference between ONU and Router. Let’s take a closer look !
Part I. Meaning of...
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it.
First, let's disable language synchronization. With a Microsoft account, language settings sync across devices. To prevent any complications,...
| |
by: Hystou |
last post by:
Overview:
Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows Update option using the Control Panel or Settings app; it automatically checks for updates and installs any it finds, whether you like it or not. For most users, this new feature is actually very convenient. If you want to control the update process,...
|
by: tracyyun |
last post by:
Dear forum friends,
With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each protocol has its own unique characteristics and advantages, but as a user who is planning to build a smart home system, I am a bit confused by the choice of these technologies. I'm particularly interested in Zigbee because I've heard it does some...
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome a new presenter, Adolph Dupré who will be discussing some powerful techniques for using class modules.
He will explain when you may want to use classes instead of User Defined Types (UDT). For example, to manage the data in unbound forms.
Adolph will...
|
by: conductexam |
last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one.
At the time of converting from word file to html my equations which are in the word document file was convert into image.
Globals.ThisAddIn.Application.ActiveDocument.Select();...
|
by: TSSRALBI |
last post by:
Hello
I'm a network technician in training and I need your help.
I am currently learning how to create and manage the different types of VPNs and I have a question about LAN-to-LAN VPNs.
The last exercise I practiced was to create a LAN-to-LAN VPN between two Pfsense firewalls, by using IPSEC protocols.
I succeeded, with both firewalls in the same network. But I'm wondering if it's possible to do the same thing, with 2 Pfsense firewalls...
|
by: adsilva |
last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?
| |
by: 6302768590 |
last post by:
Hai team
i want code for transfer the data from one system to another through IP address by using C# our system has to for every 5mins then we have to update the data what the data is updated we have to send another system
| |