THE POWER OF GEOMETRIC DUALITY

[1] BROWN KQ, 1979, THESIS CARNEGIEMELLO

[2] Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P122, DOI 10.1109/SFCS.1983.17

[3] CHAZELLE B, 1983, CS8313 BROWN U TECHN

[4] CHAZELLE B, 1980, 12TH P ANN ACM S THE, P146

[5] POLYGONAL INTERSECTION SEARCHING [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (02) : 74 - 79

[6] Edelsbrunner H., 1983, 24th Annual Symposium on Foundations of Computer Science, P83, DOI 10.1109/SFCS.1983.11

[7] EDELSBRUNNER H, 1983, COMMUNICATION JUN

[8] EDELSBRUNNER H, 1982, F98 TU GRAZ TECH REP

[9] EDELSBRUNNER H, 1983, F111 TU GRAZ TECH RE

[10] TRIANGULATING A SIMPLE POLYGON [J]. INFORMATION PROCESSING LETTERS, 1978, 7 (04) : 175 - 179

[1] BROWN KQ, 1979, THESIS CARNEGIEMELLO

[2] Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P122, DOI 10.1109/SFCS.1983.17

[3] CHAZELLE B, 1983, CS8313 BROWN U TECHN

[4] CHAZELLE B, 1980, 12TH P ANN ACM S THE, P146

[5] POLYGONAL INTERSECTION SEARCHING [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (02) : 74 - 79

[6] Edelsbrunner H., 1983, 24th Annual Symposium on Foundations of Computer Science, P83, DOI 10.1109/SFCS.1983.11

[7] EDELSBRUNNER H, 1983, COMMUNICATION JUN

[8] EDELSBRUNNER H, 1982, F98 TU GRAZ TECH REP

[9] EDELSBRUNNER H, 1983, F111 TU GRAZ TECH RE

[10] TRIANGULATING A SIMPLE POLYGON [J]. INFORMATION PROCESSING LETTERS, 1978, 7 (04) : 175 - 179