Stats

  • Locked Locked
  • Replies 5
  • Subscribers 144
  • Views 18383
  • Members are here 0
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

Determine a point is inside of a polygon or outside...

Alvin Park

Hi.... This is KT PARK in Korea. 

Do you have any SKILL Command or code 

to determine a point is inside of a polygon or outside at Virtuoso Layout Suit?

 

 dbLayerInside or dbLayerOutside does not help.... T_T

Parents
  • Slayer

     There is my small function, instead leIsPointInsideFig()u can use my function in no graph mode and modify:

     ;-; Arguments:   n_x    - x coord for cheking point
    ;-;         n_y    - y coord for cheking point
    ;-;         l_points - points of shape
    ;-;  
    ;-; Return value: list of points
    ;-;  
    ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
    procedure(IsPointInPolygon(n_x n_y l_points)
        let( (n b1 b2 b_flag xpi ypi i)
           
            n = length(l_points);
        xpi = declare(xpi[n+1]);
        ypi = declare(ypi[n+1]);

        ;create array with x and y points
        for(i 1 n-1   
           xpi[i] = car(nthelem(i l_points));
           ypi[i] = cadr(nthelem(i l_points));
        );end for
       
        xpi[0] = car(nthelem(n l_points));
        ypi[0] = cadr(nthelem(n l_points));
         
        i = 0;
        b_flag = nil;

        while(i <= n-2
             b1 = (n_y > ypi[i]);
             b2 = (n_y <= ypi[i+1]);
         
         if( !((b1 && !b2) || (b2 && !b1)) then
               if( n_x-xpi[i] < (n_y-ypi[i])*(xpi[i+1]-xpi[i])/(ypi[i+1]-ypi[i]) then
             ;dprint("a vot her znaet");
                 b_flag = !b_flag;
               )
             )
         i++;
        )
       
        b_flag;
          
        );end let
    );procedure.
     

Reply
  • Slayer

     There is my small function, instead leIsPointInsideFig()u can use my function in no graph mode and modify:

     ;-; Arguments:   n_x    - x coord for cheking point
    ;-;         n_y    - y coord for cheking point
    ;-;         l_points - points of shape
    ;-;  
    ;-; Return value: list of points
    ;-;  
    ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
    procedure(IsPointInPolygon(n_x n_y l_points)
        let( (n b1 b2 b_flag xpi ypi i)
           
            n = length(l_points);
        xpi = declare(xpi[n+1]);
        ypi = declare(ypi[n+1]);

        ;create array with x and y points
        for(i 1 n-1   
           xpi[i] = car(nthelem(i l_points));
           ypi[i] = cadr(nthelem(i l_points));
        );end for
       
        xpi[0] = car(nthelem(n l_points));
        ypi[0] = cadr(nthelem(n l_points));
         
        i = 0;
        b_flag = nil;

        while(i <= n-2
             b1 = (n_y > ypi[i]);
             b2 = (n_y <= ypi[i+1]);
         
         if( !((b1 && !b2) || (b2 && !b1)) then
               if( n_x-xpi[i] < (n_y-ypi[i])*(xpi[i+1]-xpi[i])/(ypi[i+1]-ypi[i]) then
             ;dprint("a vot her znaet");
                 b_flag = !b_flag;
               )
             )
         i++;
        )
       
        b_flag;
          
        );end let
    );procedure.
     

Children
No Data

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.