<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE bugzilla SYSTEM "https://bugs.webkit.org/page.cgi?id=bugzilla.dtd">

<bugzilla version="5.0.4.1"
          urlbase="https://bugs.webkit.org/"
          
          maintainer="admin@webkit.org"
>

    <bug>
          <bug_id>107563</bug_id>
          
          <creation_ts>2013-01-22 10:42:57 -0800</creation_ts>
          <short_desc>[CSS Shapes] Should use Bentley-Ottmann to compute offset edge intersections</short_desc>
          <delta_ts>2014-02-07 15:01:04 -0800</delta_ts>
          <reporter_accessible>1</reporter_accessible>
          <cclist_accessible>1</cclist_accessible>
          <classification_id>1</classification_id>
          <classification>Unclassified</classification>
          <product>WebKit</product>
          <component>CSS</component>
          <version>528+ (Nightly build)</version>
          <rep_platform>Unspecified</rep_platform>
          <op_sys>Unspecified</op_sys>
          <bug_status>RESOLVED</bug_status>
          <resolution>WONTFIX</resolution>
          
          
          <bug_file_loc></bug_file_loc>
          <status_whiteboard></status_whiteboard>
          <keywords></keywords>
          <priority>P2</priority>
          <bug_severity>Normal</bug_severity>
          <target_milestone>---</target_milestone>
          <dependson>103429</dependson>
          
          <everconfirmed>1</everconfirmed>
          <reporter name="Hans Muller">giles_joplin</reporter>
          <assigned_to name="Nobody">webkit-unassigned</assigned_to>
          <cc>zoltan</cc>
          

      

      

      

          <comment_sort_order>oldest_to_newest</comment_sort_order>  
          <long_desc isprivate="0" >
    <commentid>813169</commentid>
    <comment_count>0</comment_count>
    <who name="Hans Muller">giles_joplin</who>
    <bug_when>2013-01-22 10:42:57 -0800</bug_when>
    <thetext>Computing the offset edge intersections could be done in roughly O(log N) time (N is the number of edges) by using the Bentley-Ottmann algorithm.

The current simple algorithm is O(N!)</thetext>
  </long_desc><long_desc isprivate="0" >
    <commentid>978084</commentid>
    <comment_count>1</comment_count>
    <who name="Zoltan Horvath">zoltan</who>
    <bug_when>2014-02-07 15:01:04 -0800</bug_when>
    <thetext>Closing as wontfix. We can reopen once we want to do this.</thetext>
  </long_desc>
      
      

    </bug>

</bugzilla>