Found: 6
Select item for more details and to access through your institution.
MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS.
- Published in:
- International Journal of Computational Geometry & Applications, 2010, v. 20, n. 2, p. 105, doi. 10.1142/S0218195910003220
- By:
- Publication type:
- Article
GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST.
- Published in:
- International Journal of Computational Geometry & Applications, 2010, v. 20, n. 2, p. 119, doi. 10.1142/S0218195910003232
- By:
- Publication type:
- Article
COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD.
- Published in:
- International Journal of Computational Geometry & Applications, 2010, v. 20, n. 2, p. 147, doi. 10.1142/S0218195910003244
- By:
- Publication type:
- Article
FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE.
- Published in:
- International Journal of Computational Geometry & Applications, 2010, v. 20, n. 2, p. 175, doi. 10.1142/S0218195910003256
- By:
- Publication type:
- Article
OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS.
- Published in:
- International Journal of Computational Geometry & Applications, 2010, v. 20, n. 2, p. 203, doi. 10.1142/S0218195910003268
- By:
- Publication type:
- Article
DISSECTIONS OF POLYGONS INTO CONVEX POLYGONS.
- Published in:
- International Journal of Computational Geometry & Applications, 2010, v. 20, n. 2, p. 223, doi. 10.1142/S021819591000327X
- By:
- Publication type:
- Article