Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon
International Journal of Foundations of Computer Science, ISSN: 0129-0541, Vol: 31, Issue: 4, Page: 421-443
2020
- 3Usage
- 1Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Usage3
- Abstract Views3
- Captures1
- Readers1
Article Description
Given a convex polygon with n vertices, we study the problem of identifying a triangle with its smallest side as large as possible among all the triangles that can be drawn inside the polygon. We show that at least one of the vertices of such a triangle must coincide with a vertex of the polygon. We also propose an O(n2) time algorithm to compute such a triangle inside the given convex polygon.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85090511857&origin=inward; http://dx.doi.org/10.1142/s0129054120500173; https://www.worldscientific.com/doi/abs/10.1142/S0129054120500173; https://www.worldscientific.com/doi/pdf/10.1142/S0129054120500173; https://digitalcommons.isical.ac.in/journal-articles/256; https://digitalcommons.isical.ac.in/cgi/viewcontent.cgi?article=2010&context=journal-articles
World Scientific Pub Co Pte Lt
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know