File Download

There are no files associated with this item.

Supplementary

Conference Paper: A technique for polygon inclusion problem

TitleA technique for polygon inclusion problem
Authors
Jin, KHuang, Z
Issue Date2018
Citation
The 34th Symposium on Computational Geometry (SoCG): Young Researchers Forum, Budapest, Hungary, 11-14 June 2018 How to Cite?
AbstractThe widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect recently by Keikha et. al. We present an alternative algorithm in this paper. Comparing to the only previously known correct solution, ours is much simpler and more efficient. More importantly, our new approach is powerful in solving related problems.
Persistent Identifierhttp://hdl.handle.net/10722/259650

 

DC FieldValueLanguage
dc.contributor.authorJin, K-
dc.contributor.authorHuang, Z-
dc.date.accessioned2018-09-03T04:11:29Z-
dc.date.available2018-09-03T04:11:29Z-
dc.date.issued2018-
dc.identifier.citationThe 34th Symposium on Computational Geometry (SoCG): Young Researchers Forum, Budapest, Hungary, 11-14 June 2018-
dc.identifier.urihttp://hdl.handle.net/10722/259650-
dc.description.abstractThe widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect recently by Keikha et. al. We present an alternative algorithm in this paper. Comparing to the only previously known correct solution, ours is much simpler and more efficient. More importantly, our new approach is powerful in solving related problems.-
dc.languageeng-
dc.relation.ispartofSymposium on Computational Geometry (SoCG): Young Researchers Forum-
dc.titleA technique for polygon inclusion problem-
dc.typeConference_Paper-
dc.identifier.emailJin, K: cskaijin@hku.hk-
dc.identifier.emailHuang, Z: zhiyi@cs.hku.hk-
dc.identifier.authorityHuang, Z=rp01804-
dc.identifier.hkuros289847-
dc.publisher.placeBudapest, Hungary-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats