yang686526

how to finding wheter a region is inside another region.

how to find whether a region is inside another region.
hi all,
i have a query regarding finding a region inside another one. i'm having a pair of regions created by polylines, say region1 and region2. i would like to know whether the second region region2, is fully inside region 1 or not..
how do i achieve this...
is there any built in functions for this..?
tia
----------------------
regards,
rajesh parameswaran.
last edited by rajuinnet; 11th october 2004 at 04:35 amfff">.

rajuinnet
# 11th october 2004, 06:44 am

registered user join date: jan 2003
posts: 16
quote:
originally posted by rajuinnet
hi all,
i have a query regarding finding a region inside another one. i'm having a pair of regions created by polylines, say region1 and region2. i would like to know whether the second region region2, is fully inside region 1 or not..
how do i achieve this...
is there any built in functions for this..?
tia
----------------------
regards,
rajesh parameswaran.
if all points of region2 are inside region1 and there are no intersections between the edges of regions1 and region2 you may assume that region2 is inside region1...

dm, arkey systems bv
# 11th october 2004, 11:55 pm

registered user join date: jul 2004
location: india
posts: 82

region finding
quote:
originally posted by dm, arkey systems bv
if all points of region2 are inside region1 and there are no intersections between the edges of regions1 and region2 you may assume that region2 is inside region1...
hi dm, arkey systems bv
are u saying that i have to track each and every point on the edges of the two regions.? so if i am having a a lot of large regions, then it will be a tedious task to find out and also too time consuming..
i am looking for a function similar to the function in mfc crgn::combinergn()..!!
is there any function like that for performing this check..?
still the problem using the crgn::combinergn() is that it have certain limitations.. it restricts the size of the region..
the size of a region is limited to 32,767 by 32,767 logical units or 64k of memory, whichever is smaller.
so i'm having drawing more than 4 to 5 mb. so how can achieve this..?
tia
--------------------------
regards
rajesh parameswaran

rajuinnet
# 12th october 2004, 01:06 am

registered user join date: jan 2003
posts: 16
quote:
originally posted by rajuinnet
hi dm, arkey systems bv
are u saying that i have to track each and every point on the edges of the two regions.? so if i am having a a lot of large regions, then it will be a tedious task to find out and also too time consuming..
i am looking for a function similar to the function in mfc crgn::combinergn()..!!
is there any function like that for performing this check..?
still the problem using the crgn::combinergn() is that it have certain limitations.. it restricts the size of the region..
the size of a region is limited to 32,767 by 32,767 logical units or 64k of memory, whichever is smaller.
so i'm having drawing more than 4 to 5 mb. so how can achieve this..?
tia
--------------------------
regards
rajesh parameswaran
of course you can do some optimization by first comparing the extents of the regions but after that it's a hell of a job... maybe in your case there are other optimizations depending on the complexity of the region you got but there might be cases that all points of region2 are inside region1 but some segments are intersecting... if that does not matter then simply checking each point might be enough...
good luck!

dm, arkey systems bv

none
? | ?
thread tools



display modes
linear mode


search this thread

rate this thread
excellent
good
average
bad
terrible

posting rules
you may post new threads
you may post replies
you may post attachments
you may edit your posts
is on
are on
code is off
html code is off
forum jump
user control panel private messages subscriptions who's online search forums forums home general topics news questions and remarks business issues industry commentary general software issues documentation issues future directions dwg libraries dwgdirect.net dwgdirect, c++ version dwgdirectx, activex version adtdirect/c3ddirect opendwg toolkit/viewkit dgn libraries dgndirect, c++ version (2.x+) dgndirect libraries (legacy 0.99xx)
all times are gmt -7. the time now is 12:50 amfff">.
- - -
copyright ?2000 - 2009, jelsoft enterprises ltd.
copyright 1998-2008 open design alliance inc.
quote:
originally posted by rajuinnet
hi all,
i have a query regarding finding a region inside another one. i'm having a pair of regions created by polylines, say region1 and region2. i would like to know whether the second region region2, is fully inside region 1 or not..
how do i achieve this...
is there any built in functions for this..?
tia
----------------------
regards,
rajesh parameswaran.
if all points of region2 are inside region1 and there are no intersections between the edges of regions1 and region2 you may assume that region2 is inside region1...

region finding
quote:
originally posted by dm, arkey systems bv
if all points of region2 are inside region1 and there are no intersections between the edges of regions1 and region2 you may assume that region2 is inside region1...
hi dm, arkey systems bv
are u saying that i have to track each and every point on the edges of the two regions.? so if i am having a a lot of large regions, then it will be a tedious task to find out and also too time consuming..
i am looking for a function similar to the function in mfc crgn::combinergn()..!!
is there any function like that for performing this check..?
still the problem using the crgn::combinergn() is that it have certain limitations.. it restricts the size of the region..
the size of a region is limited to 32,767 by 32,767 logical units or 64k of memory, whichever is smaller.
so i'm having drawing more than 4 to 5 mb. so how can achieve this..?
tia
--------------------------
regards
rajesh parameswaran
quote:
originally posted by rajuinnet
hi dm, arkey systems bv
are u saying that i have to track each and every point on the edges of the two regions.? so if i am having a a lot of large regions, then it will be a tedious task to find out and also too time consuming..
i am looking for a function similar to the function in mfc crgn::combinergn()..!!
is there any function like that for performing this check..?
still the problem using the crgn::combinergn() is that it have certain limitations.. it restricts the size of the region..
the size of a region is limited to 32,767 by 32,767 logical units or 64k of memory, whichever is smaller.
so i'm having drawing more than 4 to 5 mb. so how can achieve this..?
tia
--------------------------
regards
rajesh parameswaran
of course you can do some optimization by first comparing the extents of the regions but after that it's a hell of a job... maybe in your case there are other optimizations depending on the complexity of the region you got but there might be cases that all points of region2 are inside region1 but some segments are intersecting... if that does not matter then simply checking each point might be enough...
good luck!