{"type":"video","version":"1.0","html":"<iframe width=\"560\" height=\"315\" sandbox=\"allow-same-origin allow-scripts allow-popups allow-forms\" title=\"21CS4602-UNIT 2-Closest Pair and Convex Hull Problems by Divide and Conquer\" src=\"https://visualhub.fxcams.in/videos/embed/359d9dd2-2e6d-4f22-88c9-6047cb8337a1\" frameborder=\"0\" allowfullscreen></iframe>","width":560,"height":315,"title":"21CS4602-UNIT 2-Closest Pair and Convex Hull Problems by Divide and Conquer","author_name":"21CS4602-Design and Analysis Of Algorithms","author_url":"https://visualhub.fxcams.in/video-channels/21cs4602_daa","provider_name":"PeerTube","provider_url":"https://visualhub.fxcams.in","thumbnail_url":"https://visualhub.fxcams.in/lazy-static/previews/ac478993-9a14-40da-8aed-e3d1f0560fbb.jpg","thumbnail_width":850,"thumbnail_height":480}