X-Authentication-Warning:	delorie.com: mail set sender to geda-user-bounces using -f
X-Recipient:	geda-user AT delorie DOT com
X-Original-DKIM-Signature:	v=1; a=rsa-sha256; c=relaxed/relaxed;
	d=gmail.com; s=20120113;
	h=mime-version:date:message-id:subject:from:to:content-type;
	bh=QwN03qrRORD2rM8DRrtj5HKIrwn8IsAHerHe5S4p2kk=;
	b=hYczTUngIY4E+WMJa9TFbKxm4GEdSQIfj2dvVleWkQFrlvzrqrOkB1iSxOFnbyOSZj
	8K66mWf2XDbjHsasfpRaxrH1DBTvq+SHo1CSMlnifEmPCtIEr6t+lBBOIPR/zbdZkBm3
	hsO3ErV8ihvqzY0Zkde+ptYtVvUkVjxXTtFiaCPoGTPYKXD1p3CuTj66cCwI6bYPPFG+
	Y4exokmx8TsjecMuakE4pAJAqtZIA2A5rYjF1eBZAkOuLLaAzNT3d5yhdoV7yqgs01SB
	os2TinHSU7r0hEYasO7vIW0/65XyW/kPnwKmoR7MzbhU9/R8RWgSn3M7u86aHCmSAI/7
	FX+A==
MIME-Version:	1.0
X-Received:	by 10.202.221.65 with SMTP id u62mr18835570oig.30.1450965097834;
	Thu, 24 Dec 2015 05:51:37 -0800 (PST)
Date:	Thu, 24 Dec 2015 14:51:37 +0100
Message-ID:	<CADL2oCWjwho6K04+pVn6=UQv-8QSZ5Pt6mjecsbXJ2hjXOVqQw@mail.gmail.com>
Subject:	[geda-user] Algorithm (DRC clearance net<--> net)
From:	"Nicklas Karlsson (nicklas DOT karlsson17 AT gmail DOT com) [via geda-user AT delorie DOT com]" <geda-user AT delorie DOT com>
To:	geda-user AT delorie DOT com
Reply-To:	geda-user AT delorie DOT com

--001a113cf2f83ceeb50527a52348
Content-Type: text/plain; charset=UTF-8

There have been some discussion about DRC clearance calculation. As I
understand it now clearance i calculated by growing objects on copper layer
and check if netlist changed. Someone suggested calculate distance is
better but to know there is no copper from other object withing clearance
distance is actually good enough. There is however a need for distance then
flooding copper within polygon areas.

Algorithm clearance:
1. A function to check if there are other copper objects within clearance
distance from a net, currently implemented may be good enough.
1. Assign a net name to all copper objects/"drawing primitives", probably
all drawing primitives on copper layer.
1. For each net.
2. For each clerance value of this net.
3. For the nets this clearance value should be used.
3. Check if this net are within clearance distance of nets this clearance
value should be used for.

The first question is if current algorithm make drawing primitives of net
which should be checked larger and check if netlist changed is good enough?
I expect lines and arcs would be no problem and I actually also expect text
will also work if there is a line width although text is usually less
important but outer corners of square objects? Or outer corners with any
angle?

With this algorithm net different clearance between different nets should
work although it must also be decided how the clearance values should be
attached to the nets. Even though current method to calculate distance may
not be perfect it would not stop other parts from being implemented while
the distance check algorithm may or may not be improved in the mean time.


Do anybody have any comments on the algorithm?


Nicklas Karlsson

--001a113cf2f83ceeb50527a52348
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">There have been some discussion about DRC clearance calcul=
ation. As I understand it now clearance i calculated by growing objects on =
copper layer and check if netlist changed. Someone suggested calculate dist=
ance is better but to know there is no copper from other object withing cle=
arance distance is actually good enough. There is however a need for distan=
ce then flooding copper within polygon areas.<div><br></div><div>Algorithm =
clearance:<br></div><div>1. A function to check if there are other copper o=
bjects within clearance distance from a net, currently implemented may be g=
ood enough.</div><div>1. Assign a net name to all copper objects/&quot;draw=
ing primitives&quot;, probably all drawing primitives on copper layer.</div=
><div>1. For each net.</div><div>2. For each clerance value of this net.</d=
iv><div>3. For the nets this clearance value should be used.</div><div>3. C=
heck if this net are within clearance distance of nets this clearance value=
 should be used for.</div><div><br></div><div>The first question is if curr=
ent algorithm make drawing primitives of net which should be checked larger=
 and check if netlist changed is good enough? I expect lines and arcs would=
 be no problem and I actually also expect text will also work if there is a=
 line width although text is usually less important but outer corners of sq=
uare objects? Or outer corners with any angle?</div><div><br></div><div>Wit=
h this algorithm net different clearance between different nets should work=
 although it must also be decided how the clearance values should be attach=
ed to the nets. Even though current method to calculate distance may not be=
 perfect it would not stop other parts from being implemented while the dis=
tance check algorithm may or may not be improved in the mean time.</div><di=
v><br></div><div><br></div><div>Do anybody have any comments on the algorit=
hm?</div><div><br></div><div><br></div><div>Nicklas Karlsson</div><div><br>=
</div><div><br></div></div>

--001a113cf2f83ceeb50527a52348--

- Raw text -