############################################################################### # # # Implimentation of - Bharath Ram S. and Ramanathan M., "Shortest path in a # # # # mutliply-connected domain having curved boundaries " , Computer-Aided # # # # Design, 45 (3), March 2013, pp. 723-732 # # # # Instructions: Step 1: Select the input curve file, with correct path # # # # Step 2: Choose the start and end point parameters # # # # To run the code : Download and compile IRIT from # # http://www.cs.technion.ac.il/~irit # # # # A new function "TGT2CRVS" for solving bitangent between two curves has been # # # # added to irit. To add this, replace the following files with the files # # # # downloaded from the zip file. # # # # 1.C:\irit\irit\irit\freefrm7.c # # # # 2.C:\irit\irit\irit\freeform.h # # # # 3.C:\irit\irit\irit\inptevl0.c # # # # 4.C:\irit\irit\irit\inptprsl.h # # # # Rebuild irit locally in folder "C:\irit\irit\irit\" by the command # # # # "nmake -f makefile.wnt install" # # # # Rebuild full irit in folder "C:\irit\irit\ by the command # # # # "nmake -f makefile.wnt all" # # # ###############################################################################