{"id":12689,"date":"2021-11-15T18:58:40","date_gmt":"2021-11-15T23:58:40","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12689"},"modified":"2026-06-02T14:59:26","modified_gmt":"2026-06-02T18:59:26","slug":"tr-148-an-on-log-n-algorithm-for-computing-a-link-center-in-a-simple-polygon","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1988\/tr-148-an-on-log-n-algorithm-for-computing-a-link-center-in-a-simple-polygon\/","title":{"rendered":"TR-148: An O(N Log N) Algorithm for Computing a Link Center in a Simple Polygon"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-148: An O(N Log N) Algorithm for Computing a Link Center in a Simple Polygon\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n<p>Carleton University<br>\n<a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1988\/\">Technical Report<\/a> <strong>TR-148<\/strong><br>\nSeptember 1988<\/p>\n\n\n\n<h2 id=\"an-on-log-n-algorithm-for-computing-a-link-center-in-a-simple-polygon\" class=\"wp-block-heading tr_t1\">An O(N Log N) Algorithm for Computing a Link Center in a Simple Polygon<\/h2>\n\n\n\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">H.N. Djidjev, A. Lingas, J\u00f6rg-R\u00fcdiger Sack<\/div>\n<\/div>\n<\/div>\n\n\n\n<div>\n<h3>Abstract<\/h3>\n<p>We present an algorithm that determines, in O(n log n) time, the link center of a simple n\u00advertex polygon P. As a consequence, we also obtain an O(n log n)-time solution to the problem of determining the link radius of P. Both results are improvements over the O(n2) bounds previously established for these problems.<\/p>\n<\/div>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/tr-148.pdf\">TR-148.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton University Technical Report TR-148 September 1988 An O(N Log N) Algorithm for Computing a Link Center in a Simple Polygon H.N. Djidjev, A. Lingas, J\u00f6rg-R\u00fcdiger Sack Abstract We present an algorithm that determines, in O(n log n) time, the link center of a simple n\u00advertex polygon P. As a consequence, we also obtain an [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11829,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-12689","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12689","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12689"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12689\/revisions"}],"predecessor-version":[{"id":12690,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12689\/revisions\/12690"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11829"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12689"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12689"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}