Path: news.mathworks.com!not-for-mail
From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: add-remove edges in a delaunay triangulation
Date: Wed, 7 Jul 2010 08:57:03 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 13
Message-ID: <i11fgv$p5g$1@fred.mathworks.com>
References: <i0vjqg$ftk$1@fred.mathworks.com> <i0vran$2lq$1@fred.mathworks.com>
Reply-To: <HIDDEN>
NNTP-Posting-Host: webapp-02-blr.mathworks.com
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1278493023 25776 172.30.248.37 (7 Jul 2010 08:57:03 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Wed, 7 Jul 2010 08:57:03 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 2408380
Xref: news.mathworks.com comp.soft-sys.matlab:650980

If removing or adding edges spoil the triangulation than it will not be a problem for me. I want to use the final pattern as a topology of my free space optical sensor network.

If removing an edge from one point lowers the degree of the other end, it's also fine.

In case of a vertex having too great a degree than expected, the edge removal will be done in this way: the longest edge will be removed first, and so on.

In case of adding edges to a node where the degree is low, it will be connected to another neighbor node who is also short in degree. If every possible neighbor node has satisfactory degree, than I may just leave the node with it's lower degree.

*** It may sound weird, but I need the final diagram only for a topology design. It doesn't have to look like a triangulation at the end.

Thanks for your quick reply.

-Faisal