{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:44:06Z","timestamp":1725529446358},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851257"},{"type":"electronic","value":"9783540851264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-85126-4_8","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:19:32Z","timestamp":1237288772000},"page":"197-214","source":"Crossref","is-referenced-by-count":1,"title":["Density-Based Clustering Based on Topological Properties of the Data Set"],"prefix":"10.1007","author":[{"given":"Priyadarshi","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina L.","family":"Gavrilova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 1998), pp. 94\u2013105 (1998)","DOI":"10.1145\/276304.276314"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Amato, N., Wu, Y.: A randomized roadmap method for path and manipulation planning. IEEE Int. Conf. on Robotics and Automation, 113\u2013120 (1996)","DOI":"10.1109\/ROBOT.1996.503582"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bhattacharya, P., Gavrilova, M.L.: CRYSTAL - A new density-based fast and efficient clustering algorithm. In: 3rd International Symposium on Voronoi Diagrams in Science and Engineering, pp. 102\u2013111 (2006)","DOI":"10.1109\/ISVD.2006.18"},{"key":"8_CR4","unstructured":"Bhattacharya, P., Gavrilova, M.L.: Path planning with the required minimum clearance using the Voronoi diagram methodology. Special issue on Computational Geometry in Path Planning. IEEE RAM (2008)"},{"key":"8_CR5","unstructured":"Chang, H., Li, T.Y.: Assembly maintainability study with motion planning. In: IEEE International Conference on Robotics and Automation, pp. 1012\u20131019 (1995)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Szczerba, R.J., Uhran, Jr., J.J.: A Framed-Quadtree Approach for Determining Euclidean Shortest Paths in a 2-D Environment. IEEE Transactions on robotics and automation\u00a013(5) (1997)","DOI":"10.1109\/70.631228"},{"key":"8_CR7","unstructured":"Foss, A., Za\u00efne, O.R.: TURN* - Unsupervised Clustering of Spatial Data. In: ACM-SIKDD Intl. Conf. on Knowledge Discovery and Data Mining (submitted, 2002)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fred, A.L.N., Leitao, J.M.N.: A minimum code length technique for clustering of syntactic patterns. In: International Conference on Pattern Recognition, pp. 680\u2013684 (1996)","DOI":"10.1109\/ICPR.1996.546909"},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1142\/S0218195903001189","volume":"13","author":"M.L. Gavrilova","year":"2003","unstructured":"Gavrilova, M.L., Rokne, J.G.: Collision Detection Optimization in a Multi-Particle System. Int. J. Comput. Geometry Appl.\u00a013(4), 279\u2013301 (2003)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Geraerts, R., Overmars, M.: Clearance Based Path Optimization for Motion Planning. In: International Conference on Robotics and Automation (2004)","DOI":"10.1109\/ROBOT.2004.1307418"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility graphs. SIAM J. Computing 20 (1991)","DOI":"10.1137\/0220055"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Gold, C.: Crust and anti-crust: a one-step boundary and skeleton extraction algorithm. In: 15th ACM Symposium on Computational Geometry, pp. 189\u2013196 (1999)","DOI":"10.1145\/304893.304971"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Gold, C.M., Remmele, P.R.: Voronoi Methods in GIS. LNCS, vol. 1340, pp: 21\u201335 (1996)","DOI":"10.1007\/3-540-63818-0_2"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L.J. Guibas","year":"1992","unstructured":"Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica\u00a07, 381\u2013413 (1992)","journal-title":"Algorithmica"},{"issue":"1-2","key":"8_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1163\/156855307779293724","volume":"21","author":"Y. Dong-Hoon","year":"2007","unstructured":"Dong-Hoon, Y., Suk-Kyo, H.: A roadmap construction algorithm for mobile robot path planning using skeleton maps. Advanced Robotics\u00a021(1-2), 51\u201363 (2007)","journal-title":"Advanced Robotics"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Hussien, B.: Robot Path Planning and Obstacle Avoidance by Means of Potential Function Method. Ph.D Dissertation, University of Missouri-Columbia (1989)","DOI":"10.1117\/12.969291"},{"issue":"33","key":"8_CR17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/JRA.1986.1087051","volume":"2","author":"S. Kambhampati","year":"1986","unstructured":"Kambhampati, S., Davis, L.S.: Multiresolution path planning for mobile robots. IEEE journal of robotics and automation\u00a02(33), 135\u2013145 (1986)","journal-title":"IEEE journal of robotics and automation"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Kang, I., Kim, T., Li, K.: A spatial data mining method by Delaunay triangulation. In: 5th ACM international workshop on Advances in geographic information systems, pp. 35\u201339 (1997)","DOI":"10.1145\/267825.267836"},{"key":"8_CR19","volume-title":"Probabilistic Roadmaps for Robot Path Planning","author":"L.E. Kavraki","year":"1997","unstructured":"Kavraki, L.E., Latombe, J.C.: Probabilistic Roadmaps for Robot Path Planning. John Wiley & Sons Ltd., Chichester (1997)"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O. Khatib","year":"1986","unstructured":"Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research\u00a05, 90\u201398 (1986)","journal-title":"International Journal of Robotics Research"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Koren, Y., Borenstein, J.: Potential Field Methods and Their Inherent Limitations for Mobile Robot Navigation. In: IEEE Conference on Robotics and Automation, pp. 1398\u20131404 (1991)","DOI":"10.1109\/ROBOT.1991.131810"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Kuffner, J.J., Nishiwaki, K., Kagami, S., Inaba, M., Inoue, H.: Motion planning for humanoid robots under obstacle and dynamic balance constraints. In: IEEE International Conference on Robotics and Automation, pp. 692\u2013698 (2001)","DOI":"10.1109\/ROBOT.2001.932631"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Kuffner, J.J., Latombe, J.-C.: Interactive manipulation planning for animated characters. In: IEEE International Conference on Robotics and Automation, pp. 417\u2013418 (2000)","DOI":"10.1109\/PCCGA.2000.883973"},{"issue":"3","key":"8_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0031-3203(91)90062-A","volume":"24","author":"T. Kurita","year":"1991","unstructured":"Kurita, T.: An efficient agglomerative clustering algorithm using a heap. Pattern Recognition\u00a024(3), 205\u2013209 (1991)","journal-title":"Pattern Recognition"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.-R.: Approximating weighted shortest paths on polyhedral surfaces. In: 13th Annual Symposium on Computational Geometry (SCG 1997), pp. 264\u2013273 (1997)","DOI":"10.1145\/262839.262984"},{"key":"8_CR26","unstructured":"Lee, D.T.: Proximity and reachability in the plane, Report R-831, Dept. of Electrical Engineering, University of Illinois at Urbana-Champaign (1978)"},{"key":"8_CR27","first-page":"1670","volume":"2","author":"S. Li","year":"2003","unstructured":"Li, S., Su, Y.: Optimal transit path finding algorithm based on geographic information system. Intelligent Transportation Systems\u00a02, 1670\u20131673 (2003)","journal-title":"Intelligent Transportation Systems"},{"key":"8_CR28","unstructured":"Maritime Activity and Risk Investigation Network (2006), http:\/\/www.marin-research.ca\/"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Masehian, E., Amin-Naseri, M.R.: A voronoi diagram-visibility graph-potential field compound algorithm for robot path planning. Journal of Robotic Systems\u00a021(6) (2004)","DOI":"10.1002\/rob.20014"},{"issue":"1","key":"8_CR30","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: finding shortest paths through a weighted planar subdivision. Journal of the ACM\u00a038(1), 18\u201373 (1991)","journal-title":"Journal of the ACM"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0098-3004(03)00017-7","volume":"29","author":"M.A. Mostafavi","year":"2003","unstructured":"Mostafavi, M.A., Gold, C., Dakowicz, M.: Delete and insert operations in Voronoi\/Delaunay methods and applications. Computers & Geosciences\u00a029, 523\u2013530 (2003)","journal-title":"Computers & Geosciences"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Pizarro, D., Campusano, L.E., Roger, G.C., Patrizzio, V., Nancy, H.-K., Ilona, K.S.: Clustering of 3D Spatial Points Using Maximum Likelihood Estimator over Voronoi Tessellations: Study of the Galaxy Distribution in Redshift Space. In: 3rd International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2006), pp. 112\u2013121 (2006)","DOI":"10.1109\/ISVD.2006.15"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1051\/0004-6361:20010071","volume":"368","author":"M. Ramella","year":"2001","unstructured":"Ramella, M., Boschin, W., Fadda, D., Nonino, M.: Finding galaxy clusters using Voronoi tessellations. Astronomy and Astrophysics\u00a0368, 776\u2013786 (2001)","journal-title":"Astronomy and Astrophysics"},{"key":"8_CR34","unstructured":"Simeon, T., Chatila, R., Laumond, J.-P.: Computer aided motion for logistics in nuclear plants. In: International symposium on artificial intelligence, robotics and human centered technology for nuclear applications, pp. 46\u201353 (2002)"},{"key":"8_CR35","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1088\/1478-3975\/2\/4\/S09","volume":"2","author":"S. Thomas","year":"2005","unstructured":"Thomas, S., Song, G., Amato, N.M.: Protein folding by motion planning. Physical biology\u00a02, 148\u2013155 (2005)","journal-title":"Physical biology"},{"key":"8_CR36","series-title":"Lecture Notes in Artificial Intelligence","first-page":"327","volume-title":"Methodologies for Knowledge Discovery and Data Mining","author":"E.-C. Vladimir","year":"1999","unstructured":"Vladimir, E.-C., Michael, E.H.: Robust Clustering of Large Geo-referenced Data Sets. In: Zhong, N., Zhou, L. (eds.) PAKDD 1999. LNCS (LNAI), vol.\u00a01574, pp. 327\u2013337. Springer, Heidelberg (1999)"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Warren, C.W.: Global Path Planning Using Artificial Potential Fields. In: IEEE Conference on Robotics and Automation, pp. 316\u2013321 (1989)","DOI":"10.1109\/ROBOT.1989.100007"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Wein, R., Van den Berg, J.P., Halperin, D.: The Visibility-Voronoi complex and its applications. In: 21st Annual Symposium on Computational geometry, pp. 63\u201372 (2005)","DOI":"10.1145\/1064092.1064104"},{"key":"8_CR39","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E. Welzl","year":"1985","unstructured":"Welzl, E.: Constructing the visibility graph for n line segments in O(n 2) time. Information Processing Letters\u00a020, 167\u2013171 (1985)","journal-title":"Information Processing Letters"},{"key":"8_CR40","first-page":"24","volume":"12","author":"Y. Xu","year":"2001","unstructured":"Xu, Y., Olman, V., Xu, D.: Minimum Spanning Trees for Gene Expression Data Clustering. Genome Inform.\u00a012, 24\u201333 (2001)","journal-title":"Genome Inform."}],"container-title":["Studies in Computational Intelligence","Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85126-4_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:15:40Z","timestamp":1619522140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85126-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540851257","9783540851264"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85126-4_8","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}