Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7599385
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T22:38:54+00:00 2026-05-30T22:38:54+00:00

I have convex hull algorithm: #include <cstdlib> #include <iostream> using namespace std; typedef int

  • 0

I have convex hull algorithm:

#include <cstdlib>
#include <iostream>

using namespace std;
typedef int  point;
 void convexhull(point x[],bool onedge ){

       int N=sizeof(x)/sizeof(int);
       int p=0;
       bool used=new bool[N];
        for (int i=1;i<N;i++){
            if (x[i]<x[p])
            p=i;


            }
            int start=p;
            do
            {

                int n=-1;
                int dist=onedge?32756:0;
                 for (int i=0;i<N;i++){
                     //dont go back  to the same point  you come from
                 if (i==p) continue;
                 if (used[i]) continue;

                  //if there is not such N yet,set it to x
                  if (n==-1) n=i;
                  int cross=(x[i]-x[p])*(x[n]-x[p]);
                  //d is distance  from P to x
                  int d=(x[i]-x[p])*(x[i]-x[p]);
                  if (cross<0){
                     n=i;
                     dist=d;
                           }
                           else if (cross==0){
                                //in this case both N and X  are4 in the 
                                //same direction.if onedge is true
                                //pick the closest one,otherwidr  pick farthest one
                                if (onedge && d<dist){

                                           dist=d;
                                           n=i;


                                           }
                                           else if (!onedge && d>dist)}
                                           dist=d;
                                           n=i;

                                           }





                                }



                }



                p=n;
                used[p]=true;
                } while(start!=p);
}
int main(int argc, char *argv[])
{
    system("PAUSE");
    return EXIT_SUCCESS;
}

But when I compile it, it shows me errors like this:

26 G:\convex_hull.cpp invalid types `bool[int]' for array subscript
48 G:\convex_hull.cpp expected primary-expression before '}' token 
67 G:\convex_hull.cpp expected `,' or `;' before '=' token 

Please help me to understand what is wrong. Can’t I use integer subscripts with bool arrays?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-30T22:38:55+00:00Added an answer on May 30, 2026 at 10:38 pm

    Since you’re declaring a dynamically allocated array, you need a pointer:

    bool* used=new bool[N];
    

    You also have a bracket the other way around:

    if (!onedge && d>dist) }
    

    instead of

    if (!onedge && d>dist) {
    

    Btw, next time please take the time to properly indent your code.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Hi I know that blind convex hull has o(n^4) but I have never seen
I would like an algorithm to calculate the convex hull of 4 2D points.
I have a 2D convex polygon in 3D space and a function to measure
I have a 4 side convex Polygon defined by 4 points in 2D, and
I have two geo-spatial simple convex polygon areas, in latitudes and longitudes (decimal degrees)
Have just started using Google Chrome , and noticed in parts of our site,
Have just started using Visual Studio Professional's built-in unit testing features, which as I
I'm new in using Python - Arcmap. I have on my map a list
I have a convex polygon (typically just a rotated square), and I know all
I want to calculate a convex hull around a shape in a binary NxM

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.