{"image_url":null,"type":"rich","published":"2017-09-16 17:38:12","provider_url":"https://hatena.blog","provider_name":"Hatena Blog","height":"190","blog_title":"","width":"100%","version":"1.0","blog_url":"https://nihaoshijie.hatenadiary.jp/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fnihaoshijie.hatenadiary.jp%2Fentry%2F2017%2F09%2F16%2F173812\" title=\" - \" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","description":"1. INTRODUCTION To simplify the presentation, we assume that all the endpoints of all the rectangles are disjoint. \u8868\u73fe\u3092\u7c21\u6f54\u306b\u3059\u308b\u305f\u3081\u306b\u3001\u5168\u3066\u306e\u9577\u65b9\u5f62\u306e\u9802\u70b9\u306f\u4ed6\u306e\u9577\u65b9\u5f62\u3068\u63a5\u3057\u3066\u3044\u306a\u3044 (disjoint) \u3082\u306e\u3068\u3059\u308b\u3002 For a node x in a tree T, we denote by n(x) the number of descendants of x in T. tree T \u306e node x \u306b\u3064\u3044\u3066\u3001n(x) \u3068\u8a18\u3057\u305f\u6642\u306f T \u306e node x \u306e\u5b50\u5b6b\u306e\u6570\u3068\u3059\u2026","title":"","author_name":"domodomodomo","author_url":"https://blog.hatena.ne.jp/domodomodomo/","categories":[],"url":"https://nihaoshijie.hatenadiary.jp/entry/2017/09/16/173812"}