An Algorithm for Curve Identification in the Presence of Curve Intersections

<div>(a) An example of portions of reconstructed curves (<svg height="12.4646pt" id="M103" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -12.2582 20.3026 12.4646" width="20.3026pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.684,-5.741)"><path d="M309 -142C211 -61 151 99 151 271S210 601 309 683L288 710C141 611 75 451 75 272V271C75 90 141 -72 288 -169L309 -142Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,11.942,-5.741)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,16.374,-5.741)"><path d="M283 271C283 451 220 610 70 710L48 683C146 603 207 443 207 271S149 -59 48 -142L70 -169C220 -67 283 90 283 271Z"></path></g></svg> and <span class="nowrap"><svg height="12.4646pt" id="M104" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -12.2582 20.3026 12.4646" width="20.3026pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.684,-5.741)"><path d="M309 -142C211 -61 151 99 151 271S210 601 309 683L288 710C141 611 75 451 75 272V271C75 90 141 -72 288 -169L309 -142Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,11.942,-5.741)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,16.374,-5.741)"><path d="M283 271C283 451 220 610 70 710L48 683C146 603 207 443 207 271S149 -59 48 -142L70 -169C220 -67 283 90 283 271Z"></path></g></svg>)</span> provided by the proposed algorithm. (b) Portions of the reconstructed curves (<svg height="12.5037pt" id="M105" style="vertical-align:-0.2455006pt" version="1.1" viewbox="-0.0498162 -12.2582 20.2635 12.5037" width="20.2635pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,.046,-3.027)"><path d="M658 624L641 649C599 612 554 595 493 595C444 595 402 603 342 615C268 634 232 641 184 641C129 641 57 621 0 557L17 532C67 566 113 586 176 586C230 586 265 577 316 565C380 550 430 540 482 540C540 540 611 558 658 624Z"></path></g><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M614 175C564 76 510 21 408 21C256 21 146 149 146 336C146 488 235 629 402 629C510 629 570 586 597 480L626 488C620 541 614 582 606 638C578 643 510 665 429 665C206 665 44 527 44 316C44 157 153 -15 402 -15C474 -15 558 5 586 11C604 45 629 119 643 165L614 175Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.645,-5.741)"><path d="M309 -142C211 -61 151 99 151 271S210 601 309 683L288 710C141 611 75 451 75 272V271C75 90 141 -72 288 -169L309 -142Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,11.903,-5.741)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,16.334,-5.741)"><path d="M283 271C283 451 220 610 70 710L48 683C146 603 207 443 207 271S149 -59 48 -142L70 -169C220 -67 283 90 283 271Z"></path></g></svg> and <span class="nowrap"><svg height="12.4646pt" id="M106" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -12.2582 20.3026 12.4646" width="20.3026pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,1.305,-2.897)"><path d="M658 624L641 649C599 612 554 595 493 595C444 595 402 603 342 615C268 634 232 641 184 641C129 641 57 621 0 557L17 532C67 566 113 586 176 586C230 586 265 577 316 565C380 550 430 540 482 540C540 540 611 558 658 624Z"></path></g><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.684,-5.741)"><path d="M309 -142C211 -61 151 99 151 271S210 601 309 683L288 710C141 611 75 451 75 272V271C75 90 141 -72 288 -169L309 -142Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,11.942,-5.741)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,16.374,-5.741)"><path d="M283 271C283 451 220 610 70 710L48 683C146 603 207 443 207 271S149 -59 48 -142L70 -169C220 -67 283 90 283 271Z"></path></g></svg>)</span> obtained by swapping the fifth labels in the portions of reconstructed curves shown in (a).</div>

Mathematical Problems in Engineering

fig3

Figure 3

Figure 3: An Algorithm for Curve Identification in the Presence of Curve Intersections 